./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 35987657 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_1-2.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 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 00:46:21,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 00:46:21,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 00:46:21,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 00:46:21,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 00:46:21,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 00:46:21,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 00:46:21,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 00:46:21,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 00:46:21,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 00:46:21,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 00:46:21,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 00:46:21,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 00:46:21,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 00:46:21,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 00:46:21,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 00:46:21,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 00:46:21,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 00:46:21,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 00:46:21,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 00:46:21,385 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 00:46:21,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 00:46:21,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 00:46:21,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 00:46:21,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 00:46:21,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 00:46:21,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 00:46:21,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 00:46:21,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 00:46:21,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 00:46:21,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 00:46:21,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 00:46:21,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 00:46:21,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 00:46:21,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 00:46:21,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 00:46:21,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 00:46:21,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 00:46:21,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 00:46:21,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 00:46:21,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 00:46:21,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 00:46:21,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-22 00:46:21,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 00:46:21,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 00:46:21,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 00:46:21,438 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 00:46:21,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 00:46:21,439 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 00:46:21,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 00:46:21,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 00:46:21,440 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 00:46:21,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 00:46:21,441 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 00:46:21,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 00:46:21,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 00:46:21,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 00:46:21,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 00:46:21,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 00:46:21,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 00:46:21,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 00:46:21,443 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-22 00:46:21,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 00:46:21,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 00:46:21,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 00:46:21,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 00:46:21,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 00:46:21,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 00:46:21,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 00:46:21,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:21,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 00:46:21,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 00:46:21,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 00:46:21,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 00:46:21,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 00:46:21,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 00:46:21,446 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 -> 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 [2022-07-22 00:46:21,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 00:46:21,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 00:46:21,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 00:46:21,767 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 00:46:21,768 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 00:46:21,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2022-07-22 00:46:21,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657cd5f7b/e25bcb02780b47d49cd05a59b40e92df/FLAG1aacd45b9 [2022-07-22 00:46:22,308 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 00:46:22,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2022-07-22 00:46:22,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657cd5f7b/e25bcb02780b47d49cd05a59b40e92df/FLAG1aacd45b9 [2022-07-22 00:46:22,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657cd5f7b/e25bcb02780b47d49cd05a59b40e92df [2022-07-22 00:46:22,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 00:46:22,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 00:46:22,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:22,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 00:46:22,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 00:46:22,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:22" (1/1) ... [2022-07-22 00:46:22,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5026cc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:22, skipping insertion in model container [2022-07-22 00:46:22,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:22" (1/1) ... [2022-07-22 00:46:22,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 00:46:22,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 00:46:22,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c[816,829] [2022-07-22 00:46:22,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:23,000 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 00:46:23,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c[816,829] [2022-07-22 00:46:23,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:23,091 INFO L208 MainTranslator]: Completed translation [2022-07-22 00:46:23,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23 WrapperNode [2022-07-22 00:46:23,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:23,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:23,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 00:46:23,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 00:46:23,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,153 INFO L137 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 232 [2022-07-22 00:46:23,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:23,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 00:46:23,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 00:46:23,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 00:46:23,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 00:46:23,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 00:46:23,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 00:46:23,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 00:46:23,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (1/1) ... [2022-07-22 00:46:23,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:23,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:23,253 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-22 00:46:23,264 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-22 00:46:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 00:46:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 00:46:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-22 00:46:23,293 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-22 00:46:23,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 00:46:23,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 00:46:23,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 00:46:23,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 00:46:23,385 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 00:46:23,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 00:46:23,805 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 00:46:23,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 00:46:23,819 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 00:46:23,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:23 BoogieIcfgContainer [2022-07-22 00:46:23,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 00:46:23,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 00:46:23,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 00:46:23,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 00:46:23,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 12:46:22" (1/3) ... [2022-07-22 00:46:23,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce3757e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:23, skipping insertion in model container [2022-07-22 00:46:23,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:23" (2/3) ... [2022-07-22 00:46:23,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce3757e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:23, skipping insertion in model container [2022-07-22 00:46:23,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:23" (3/3) ... [2022-07-22 00:46:23,836 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-2.c.cil.c [2022-07-22 00:46:23,848 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 00:46:23,849 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-22 00:46:23,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 00:46:23,902 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@475b18d0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73cf0f98 [2022-07-22 00:46:23,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-22 00:46:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 119 states have (on average 1.7983193277310925) internal successors, (214), 149 states have internal predecessors, (214), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-22 00:46:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 00:46:23,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:23,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:23,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2009308700, now seen corresponding path program 1 times [2022-07-22 00:46:23,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:23,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015499732] [2022-07-22 00:46:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:24,053 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-22 00:46:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:24,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015499732] [2022-07-22 00:46:24,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015499732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:24,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:24,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:46:24,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824889752] [2022-07-22 00:46:24,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:24,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 00:46:24,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:24,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 00:46:24,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 00:46:24,094 INFO L87 Difference]: Start difference. First operand has 158 states, 119 states have (on average 1.7983193277310925) internal successors, (214), 149 states have internal predecessors, (214), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:24,154 INFO L93 Difference]: Finished difference Result 311 states and 464 transitions. [2022-07-22 00:46:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 00:46:24,156 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-22 00:46:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:24,167 INFO L225 Difference]: With dead ends: 311 [2022-07-22 00:46:24,167 INFO L226 Difference]: Without dead ends: 123 [2022-07-22 00:46:24,174 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-22 00:46:24,178 INFO L413 NwaCegarLoop]: 209 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, 209 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-22 00:46:24,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-22 00:46:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-22 00:46:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 90 states have (on average 1.5777777777777777) internal successors, (142), 115 states have internal predecessors, (142), 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-22 00:46:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 152 transitions. [2022-07-22 00:46:24,235 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 152 transitions. Word has length 9 [2022-07-22 00:46:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:24,235 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 152 transitions. [2022-07-22 00:46:24,236 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-22 00:46:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 152 transitions. [2022-07-22 00:46:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 00:46:24,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:24,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:24,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 00:46:24,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:24,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2010250048, now seen corresponding path program 1 times [2022-07-22 00:46:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:24,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611550584] [2022-07-22 00:46:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:24,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:24,343 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-22 00:46:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:24,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611550584] [2022-07-22 00:46:24,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611550584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:24,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:24,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246840488] [2022-07-22 00:46:24,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:24,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:24,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:24,347 INFO L87 Difference]: Start difference. First operand 123 states and 152 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-22 00:46:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:24,477 INFO L93 Difference]: Finished difference Result 308 states and 392 transitions. [2022-07-22 00:46:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:24,478 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-22 00:46:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:24,483 INFO L225 Difference]: With dead ends: 308 [2022-07-22 00:46:24,483 INFO L226 Difference]: Without dead ends: 188 [2022-07-22 00:46:24,488 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-22 00:46:24,489 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 100 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:24,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 404 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-22 00:46:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2022-07-22 00:46:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 138 states have (on average 1.6014492753623188) internal successors, (221), 163 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 00:46:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2022-07-22 00:46:24,515 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 9 [2022-07-22 00:46:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:24,516 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2022-07-22 00:46:24,516 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-22 00:46:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2022-07-22 00:46:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 00:46:24,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:24,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:24,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 00:46:24,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -886855989, now seen corresponding path program 1 times [2022-07-22 00:46:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:24,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28609136] [2022-07-22 00:46:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:24,587 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-22 00:46:24,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:24,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28609136] [2022-07-22 00:46:24,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28609136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:24,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:24,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 00:46:24,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345950295] [2022-07-22 00:46:24,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:24,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:24,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:24,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:24,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:24,591 INFO L87 Difference]: Start difference. First operand 172 states and 231 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-22 00:46:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:24,668 INFO L93 Difference]: Finished difference Result 319 states and 413 transitions. [2022-07-22 00:46:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 00:46:24,669 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-22 00:46:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:24,670 INFO L225 Difference]: With dead ends: 319 [2022-07-22 00:46:24,670 INFO L226 Difference]: Without dead ends: 152 [2022-07-22 00:46:24,672 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-22 00:46:24,676 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 33 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:24,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 414 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-22 00:46:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2022-07-22 00:46:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.5825242718446602) internal successors, (163), 128 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 00:46:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-07-22 00:46:24,697 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 12 [2022-07-22 00:46:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:24,697 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-07-22 00:46:24,697 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-22 00:46:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-07-22 00:46:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 00:46:24,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:24,699 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:24,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 00:46:24,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:24,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1317036064, now seen corresponding path program 1 times [2022-07-22 00:46:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:24,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949718740] [2022-07-22 00:46:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:24,788 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-22 00:46:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:24,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949718740] [2022-07-22 00:46:24,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949718740] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:24,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498759173] [2022-07-22 00:46:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:24,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:24,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:24,792 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-22 00:46:24,807 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-22 00:46:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:24,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:24,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:24,900 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-22 00:46:24,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:24,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498759173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:24,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:24,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817979190] [2022-07-22 00:46:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:24,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:24,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:24,903 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:46:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:25,023 INFO L93 Difference]: Finished difference Result 210 states and 279 transitions. [2022-07-22 00:46:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 00:46:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:25,025 INFO L225 Difference]: With dead ends: 210 [2022-07-22 00:46:25,025 INFO L226 Difference]: Without dead ends: 206 [2022-07-22 00:46:25,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:25,026 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 220 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:25,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 388 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-22 00:46:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2022-07-22 00:46:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.605263157894737) internal successors, (244), 175 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 00:46:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 254 transitions. [2022-07-22 00:46:25,034 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 254 transitions. Word has length 16 [2022-07-22 00:46:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:25,034 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 254 transitions. [2022-07-22 00:46:25,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:46:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 254 transitions. [2022-07-22 00:46:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 00:46:25,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:25,035 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:25,065 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-22 00:46:25,257 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-22 00:46:25,258 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2121555033, now seen corresponding path program 1 times [2022-07-22 00:46:25,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:25,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041997334] [2022-07-22 00:46:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:25,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 00:46:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:25,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041997334] [2022-07-22 00:46:25,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041997334] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:25,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23476805] [2022-07-22 00:46:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:25,300 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-22 00:46:25,326 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-22 00:46:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 00:46:25,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:25,358 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-22 00:46:25,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:25,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23476805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:25,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:25,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-22 00:46:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785532295] [2022-07-22 00:46:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:25,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:25,360 INFO L87 Difference]: Start difference. First operand 185 states and 254 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:46:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:25,392 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2022-07-22 00:46:25,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:25,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-22 00:46:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:25,394 INFO L225 Difference]: With dead ends: 191 [2022-07-22 00:46:25,394 INFO L226 Difference]: Without dead ends: 190 [2022-07-22 00:46:25,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:25,395 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 3 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:25,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 267 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-22 00:46:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2022-07-22 00:46:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.5921052631578947) internal successors, (242), 174 states have internal predecessors, (242), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 00:46:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 252 transitions. [2022-07-22 00:46:25,401 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 252 transitions. Word has length 17 [2022-07-22 00:46:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:25,401 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 252 transitions. [2022-07-22 00:46:25,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:46:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 252 transitions. [2022-07-22 00:46:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 00:46:25,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:25,402 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:25,427 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-22 00:46:25,627 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-22 00:46:25,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2063822584, now seen corresponding path program 1 times [2022-07-22 00:46:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:25,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274371266] [2022-07-22 00:46:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,677 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-22 00:46:25,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:25,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274371266] [2022-07-22 00:46:25,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274371266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:25,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754764115] [2022-07-22 00:46:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:25,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:25,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:25,679 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-22 00:46:25,698 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-22 00:46:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:25,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:25,755 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-22 00:46:25,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:25,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754764115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:25,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:25,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770428681] [2022-07-22 00:46:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:25,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:25,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:25,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:25,758 INFO L87 Difference]: Start difference. First operand 184 states and 252 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:46:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:25,887 INFO L93 Difference]: Finished difference Result 231 states and 308 transitions. [2022-07-22 00:46:25,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:25,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-22 00:46:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:25,889 INFO L225 Difference]: With dead ends: 231 [2022-07-22 00:46:25,889 INFO L226 Difference]: Without dead ends: 226 [2022-07-22 00:46:25,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:25,891 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 204 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:25,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 411 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-22 00:46:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 204. [2022-07-22 00:46:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 172 states have (on average 1.563953488372093) internal successors, (269), 194 states have internal predecessors, (269), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 00:46:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2022-07-22 00:46:25,903 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 18 [2022-07-22 00:46:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:25,904 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2022-07-22 00:46:25,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 00:46:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2022-07-22 00:46:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 00:46:25,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:25,906 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-22 00:46:25,932 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-22 00:46:26,119 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-22 00:46:26,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 448182187, now seen corresponding path program 1 times [2022-07-22 00:46:26,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:26,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049022516] [2022-07-22 00:46:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 00:46:26,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 00:46:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 00:46:26,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 00:46:26,151 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 00:46:26,152 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2022-07-22 00:46:26,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2022-07-22 00:46:26,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2022-07-22 00:46:26,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2022-07-22 00:46:26,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2022-07-22 00:46:26,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2022-07-22 00:46:26,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2022-07-22 00:46:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2022-07-22 00:46:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2022-07-22 00:46:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2022-07-22 00:46:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2022-07-22 00:46:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2022-07-22 00:46:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2022-07-22 00:46:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2022-07-22 00:46:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2022-07-22 00:46:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2022-07-22 00:46:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2022-07-22 00:46:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2022-07-22 00:46:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2022-07-22 00:46:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2022-07-22 00:46:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2022-07-22 00:46:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2022-07-22 00:46:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2022-07-22 00:46:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2022-07-22 00:46:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2022-07-22 00:46:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2022-07-22 00:46:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2022-07-22 00:46:26,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2022-07-22 00:46:26,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 00:46:26,160 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:26,163 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 00:46:26,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 12:46:26 BoogieIcfgContainer [2022-07-22 00:46:26,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 00:46:26,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 00:46:26,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 00:46:26,187 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 00:46:26,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:23" (3/4) ... [2022-07-22 00:46:26,190 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 00:46:26,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 00:46:26,190 INFO L158 Benchmark]: Toolchain (without parser) took 3479.90ms. Allocated memory was 52.4MB in the beginning and 79.7MB in the end (delta: 27.3MB). Free memory was 28.8MB in the beginning and 45.8MB in the end (delta: -17.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-07-22 00:46:26,190 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:46:26,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.04ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.6MB in the beginning and 43.4MB in the end (delta: -14.9MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-07-22 00:46:26,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.64ms. Allocated memory is still 65.0MB. Free memory was 43.4MB in the beginning and 41.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 00:46:26,191 INFO L158 Benchmark]: Boogie Preprocessor took 55.43ms. Allocated memory is still 65.0MB. Free memory was 41.0MB in the beginning and 39.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:46:26,192 INFO L158 Benchmark]: RCFGBuilder took 610.63ms. Allocated memory is still 65.0MB. Free memory was 39.1MB in the beginning and 31.2MB in the end (delta: 7.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2022-07-22 00:46:26,192 INFO L158 Benchmark]: TraceAbstraction took 2363.49ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 45.8MB in the end (delta: -15.3MB). Peak memory consumption was 279.9kB. Max. memory is 16.1GB. [2022-07-22 00:46:26,192 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 79.7MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:46:26,193 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 52.4MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.04ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.6MB in the beginning and 43.4MB in the end (delta: -14.9MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.64ms. Allocated memory is still 65.0MB. Free memory was 43.4MB in the beginning and 41.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.43ms. Allocated memory is still 65.0MB. Free memory was 41.0MB in the beginning and 39.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 610.63ms. Allocated memory is still 65.0MB. Free memory was 39.1MB in the beginning and 31.2MB in the end (delta: 7.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2363.49ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 45.8MB in the end (delta: -15.3MB). Peak memory consumption was 279.9kB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 79.7MB. Free memory is still 45.8MB. 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: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 80. Possible FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add ; [L237] unsigned int zero ; [L238] int sa ; [L239] int sb ; [L240] int tmp ; [L241] int tmp___0 ; [L242] int tmp___1 ; [L243] int tmp___2 ; [L244] int tmp___3 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L247] int tmp___6 ; [L248] int tmp___7 ; [L249] int tmp___8 ; [L250] int tmp___9 ; [L251] int __retres23 ; VAL [ea=0, eb=0] [L255] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L84] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L255] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L255] zero = base2flt(0, 0) [L256] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L61] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L80] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L81] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: 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, 158 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 560 mSDsluCounter, 2093 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1214 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 879 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 80 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 299 SizeOfPredicates, 2 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 9/12 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-22 00:46:26,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample