./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 839c364b 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_4-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 22:43:32,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 22:43:32,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 22:43:32,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 22:43:32,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 22:43:32,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 22:43:32,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 22:43:32,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 22:43:32,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 22:43:32,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 22:43:32,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 22:43:32,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 22:43:32,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 22:43:32,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 22:43:32,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 22:43:32,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 22:43:32,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 22:43:32,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 22:43:32,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 22:43:32,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 22:43:32,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 22:43:32,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 22:43:32,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 22:43:32,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 22:43:32,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 22:43:32,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 22:43:32,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 22:43:32,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 22:43:32,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 22:43:32,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 22:43:32,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 22:43:32,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 22:43:32,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 22:43:32,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 22:43:32,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 22:43:32,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 22:43:32,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 22:43:32,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 22:43:32,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 22:43:32,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 22:43:32,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 22:43:32,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-14 22:43:32,358 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 22:43:32,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 22:43:32,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 22:43:32,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 22:43:32,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 22:43:32,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 22:43:32,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 22:43:32,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 22:43:32,360 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 22:43:32,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 22:43:32,361 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 22:43:32,361 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 22:43:32,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 22:43:32,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 22:43:32,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 22:43:32,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 22:43:32,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 22:43:32,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 22:43:32,362 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-14 22:43:32,363 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 22:43:32,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 22:43:32,363 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 22:43:32,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 22:43:32,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 22:43:32,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 22:43:32,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 22:43:32,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 22:43:32,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 22:43:32,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 22:43:32,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 22:43:32,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 22:43:32,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 22:43:32,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 22:43:32,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 22:43:32,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2021-12-14 22:43:32,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 22:43:32,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 22:43:32,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 22:43:32,606 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 22:43:32,607 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 22:43:32,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2021-12-14 22:43:32,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442edd6a9/b917bd3b34d648a98161fc03d5676f65/FLAG2fad73c17 [2021-12-14 22:43:33,046 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 22:43:33,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2021-12-14 22:43:33,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442edd6a9/b917bd3b34d648a98161fc03d5676f65/FLAG2fad73c17 [2021-12-14 22:43:33,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442edd6a9/b917bd3b34d648a98161fc03d5676f65 [2021-12-14 22:43:33,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 22:43:33,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 22:43:33,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 22:43:33,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 22:43:33,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 22:43:33,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a16255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33, skipping insertion in model container [2021-12-14 22:43:33,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 22:43:33,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 22:43:33,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c[755,768] [2021-12-14 22:43:33,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 22:43:33,350 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 22:43:33,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c[755,768] [2021-12-14 22:43:33,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 22:43:33,419 INFO L208 MainTranslator]: Completed translation [2021-12-14 22:43:33,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33 WrapperNode [2021-12-14 22:43:33,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 22:43:33,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 22:43:33,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 22:43:33,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 22:43:33,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,459 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2021-12-14 22:43:33,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 22:43:33,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 22:43:33,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 22:43:33,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 22:43:33,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 22:43:33,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 22:43:33,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 22:43:33,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 22:43:33,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (1/1) ... [2021-12-14 22:43:33,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 22:43:33,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:33,545 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) [2021-12-14 22:43:33,551 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 [2021-12-14 22:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 22:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 22:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2021-12-14 22:43:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2021-12-14 22:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 22:43:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 22:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2021-12-14 22:43:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2021-12-14 22:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 22:43:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 22:43:33,635 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 22:43:33,637 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 22:43:33,845 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 22:43:33,850 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 22:43:33,850 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 22:43:33,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:43:33 BoogieIcfgContainer [2021-12-14 22:43:33,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 22:43:33,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 22:43:33,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 22:43:33,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 22:43:33,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:43:33" (1/3) ... [2021-12-14 22:43:33,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3286b766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:43:33, skipping insertion in model container [2021-12-14 22:43:33,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:43:33" (2/3) ... [2021-12-14 22:43:33,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3286b766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:43:33, skipping insertion in model container [2021-12-14 22:43:33,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:43:33" (3/3) ... [2021-12-14 22:43:33,858 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2021-12-14 22:43:33,862 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 22:43:33,862 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-12-14 22:43:33,892 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 22:43:33,896 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 22:43:33,897 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-12-14 22:43:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.625) internal successors, (91), 72 states have internal predecessors, (91), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 22:43:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 22:43:33,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:33,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:33,911 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash 915940719, now seen corresponding path program 1 times [2021-12-14 22:43:33,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:33,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189349847] [2021-12-14 22:43:33,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:33,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:43:34,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:34,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189349847] [2021-12-14 22:43:34,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189349847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:34,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:34,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 22:43:34,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992109328] [2021-12-14 22:43:34,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:34,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 22:43:34,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 22:43:34,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 22:43:34,063 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.625) internal successors, (91), 72 states have internal predecessors, (91), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:34,089 INFO L93 Difference]: Finished difference Result 163 states and 218 transitions. [2021-12-14 22:43:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 22:43:34,090 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 [2021-12-14 22:43:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:34,097 INFO L225 Difference]: With dead ends: 163 [2021-12-14 22:43:34,098 INFO L226 Difference]: Without dead ends: 72 [2021-12-14 22:43:34,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 22:43:34,120 INFO L933 BasicCegarLoop]: 99 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, 99 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 [2021-12-14 22:43:34,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-14 22:43:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-14 22:43:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 62 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2021-12-14 22:43:34,162 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 9 [2021-12-14 22:43:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:34,163 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2021-12-14 22:43:34,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2021-12-14 22:43:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 22:43:34,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:34,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:34,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 22:43:34,181 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash 914999453, now seen corresponding path program 1 times [2021-12-14 22:43:34,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:34,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340594829] [2021-12-14 22:43:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:34,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:43:34,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:34,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340594829] [2021-12-14 22:43:34,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340594829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:34,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:34,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 22:43:34,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96741880] [2021-12-14 22:43:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:34,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:43:34,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:34,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:43:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:43:34,221 INFO L87 Difference]: Start difference. First operand 72 states and 86 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) [2021-12-14 22:43:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:34,281 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2021-12-14 22:43:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:43:34,282 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 [2021-12-14 22:43:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:34,284 INFO L225 Difference]: With dead ends: 181 [2021-12-14 22:43:34,284 INFO L226 Difference]: Without dead ends: 112 [2021-12-14 22:43:34,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:43:34,286 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:34,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 227 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-14 22:43:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2021-12-14 22:43:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 92 states have internal predecessors, (116), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2021-12-14 22:43:34,297 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 9 [2021-12-14 22:43:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:34,297 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2021-12-14 22:43:34,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2021-12-14 22:43:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 22:43:34,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:34,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:34,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 22:43:34,299 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:34,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash -718991324, now seen corresponding path program 1 times [2021-12-14 22:43:34,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:34,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513665382] [2021-12-14 22:43:34,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:34,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:43:34,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:34,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513665382] [2021-12-14 22:43:34,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513665382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:34,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:34,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:43:34,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599292391] [2021-12-14 22:43:34,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:34,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:43:34,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:34,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:43:34,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:43:34,334 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:34,394 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2021-12-14 22:43:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 22:43:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 22:43:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:34,396 INFO L225 Difference]: With dead ends: 122 [2021-12-14 22:43:34,396 INFO L226 Difference]: Without dead ends: 120 [2021-12-14 22:43:34,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:43:34,397 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:34,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 306 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-14 22:43:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2021-12-14 22:43:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.4625) internal successors, (117), 94 states have internal predecessors, (117), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2021-12-14 22:43:34,407 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 13 [2021-12-14 22:43:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:34,407 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2021-12-14 22:43:34,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2021-12-14 22:43:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 22:43:34,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:34,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:34,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 22:43:34,409 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash -813894463, now seen corresponding path program 1 times [2021-12-14 22:43:34,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:34,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706313955] [2021-12-14 22:43:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:34,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:43:34,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:34,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706313955] [2021-12-14 22:43:34,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706313955] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:34,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:34,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:43:34,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488356981] [2021-12-14 22:43:34,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:34,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:43:34,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:43:34,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:43:34,443 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:34,505 INFO L93 Difference]: Finished difference Result 198 states and 237 transitions. [2021-12-14 22:43:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 22:43:34,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 22:43:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:34,507 INFO L225 Difference]: With dead ends: 198 [2021-12-14 22:43:34,507 INFO L226 Difference]: Without dead ends: 126 [2021-12-14 22:43:34,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:43:34,509 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 94 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:34,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 246 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-14 22:43:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2021-12-14 22:43:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 98 states have internal predecessors, (121), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2021-12-14 22:43:34,518 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 14 [2021-12-14 22:43:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:34,519 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2021-12-14 22:43:34,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2021-12-14 22:43:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 22:43:34,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:34,520 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:34,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 22:43:34,520 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash -459560941, now seen corresponding path program 1 times [2021-12-14 22:43:34,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:34,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798010034] [2021-12-14 22:43:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:34,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:43:34,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:34,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798010034] [2021-12-14 22:43:34,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798010034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:34,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:34,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:43:34,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532765453] [2021-12-14 22:43:34,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:34,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:43:34,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:43:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:43:34,559 INFO L87 Difference]: Start difference. First operand 109 states and 134 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) [2021-12-14 22:43:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:34,626 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2021-12-14 22:43:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 22:43:34,627 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 [2021-12-14 22:43:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:34,628 INFO L225 Difference]: With dead ends: 150 [2021-12-14 22:43:34,629 INFO L226 Difference]: Without dead ends: 147 [2021-12-14 22:43:34,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:43:34,631 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 63 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:34,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 281 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-14 22:43:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2021-12-14 22:43:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.438095238095238) internal successors, (151), 118 states have internal predecessors, (151), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2021-12-14 22:43:34,647 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 16 [2021-12-14 22:43:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:34,647 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2021-12-14 22:43:34,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 22:43:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2021-12-14 22:43:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 22:43:34,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:34,648 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:34,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 22:43:34,649 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1079576499, now seen corresponding path program 1 times [2021-12-14 22:43:34,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:34,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350097414] [2021-12-14 22:43:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:34,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:43:34,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:34,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350097414] [2021-12-14 22:43:34,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350097414] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:34,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485613102] [2021-12-14 22:43:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:34,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:34,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:34,683 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) [2021-12-14 22:43:34,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 22:43:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:34,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 22:43:34,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:43:34,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 22:43:34,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485613102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:34,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 22:43:34,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-14 22:43:34,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086742808] [2021-12-14 22:43:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:34,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:43:34,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:43:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:43:34,915 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:34,960 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2021-12-14 22:43:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:43:34,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-14 22:43:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:34,972 INFO L225 Difference]: With dead ends: 158 [2021-12-14 22:43:34,972 INFO L226 Difference]: Without dead ends: 157 [2021-12-14 22:43:34,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 22:43:34,974 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:34,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 245 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-14 22:43:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 128. [2021-12-14 22:43:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 116 states have internal predecessors, (147), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2021-12-14 22:43:35,012 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 15 [2021-12-14 22:43:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:35,012 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2021-12-14 22:43:35,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2021-12-14 22:43:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 22:43:35,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:35,014 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:35,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:35,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 22:43:35,228 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1361487226, now seen corresponding path program 1 times [2021-12-14 22:43:35,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:35,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225210342] [2021-12-14 22:43:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:35,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 22:43:35,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:35,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225210342] [2021-12-14 22:43:35,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225210342] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:35,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:35,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 22:43:35,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360100876] [2021-12-14 22:43:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:35,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 22:43:35,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:35,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 22:43:35,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:43:35,281 INFO L87 Difference]: Start difference. First operand 128 states and 160 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) [2021-12-14 22:43:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:35,310 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2021-12-14 22:43:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 22:43:35,310 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 [2021-12-14 22:43:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:35,311 INFO L225 Difference]: With dead ends: 137 [2021-12-14 22:43:35,312 INFO L226 Difference]: Without dead ends: 136 [2021-12-14 22:43:35,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 22:43:35,313 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:35,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-14 22:43:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2021-12-14 22:43:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 113 states have internal predecessors, (142), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2021-12-14 22:43:35,342 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 17 [2021-12-14 22:43:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:35,342 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2021-12-14 22:43:35,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 22:43:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2021-12-14 22:43:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 22:43:35,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:35,345 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:35,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 22:43:35,345 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1631017083, now seen corresponding path program 1 times [2021-12-14 22:43:35,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:35,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732559016] [2021-12-14 22:43:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:35,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 22:43:35,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:35,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732559016] [2021-12-14 22:43:35,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732559016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:35,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:35,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:43:35,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923222911] [2021-12-14 22:43:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:35,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:43:35,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:35,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:43:35,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:43:35,418 INFO L87 Difference]: Start difference. First operand 125 states and 155 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) [2021-12-14 22:43:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:35,478 INFO L93 Difference]: Finished difference Result 145 states and 174 transitions. [2021-12-14 22:43:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 22:43:35,478 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 [2021-12-14 22:43:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:35,481 INFO L225 Difference]: With dead ends: 145 [2021-12-14 22:43:35,481 INFO L226 Difference]: Without dead ends: 143 [2021-12-14 22:43:35,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:43:35,484 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:35,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 280 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-14 22:43:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2021-12-14 22:43:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 116 states have internal predecessors, (144), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2021-12-14 22:43:35,502 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 18 [2021-12-14 22:43:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:35,503 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2021-12-14 22:43:35,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 22:43:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2021-12-14 22:43:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 22:43:35,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:35,505 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:35,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 22:43:35,506 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:35,507 INFO L85 PathProgramCache]: Analyzing trace with hash -424506547, now seen corresponding path program 1 times [2021-12-14 22:43:35,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:35,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217896648] [2021-12-14 22:43:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:35,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 22:43:35,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:35,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217896648] [2021-12-14 22:43:35,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217896648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:35,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:35,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 22:43:35,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710693936] [2021-12-14 22:43:35,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:35,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 22:43:35,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 22:43:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:43:35,536 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:35,559 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2021-12-14 22:43:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 22:43:35,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 22:43:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:35,560 INFO L225 Difference]: With dead ends: 157 [2021-12-14 22:43:35,560 INFO L226 Difference]: Without dead ends: 156 [2021-12-14 22:43:35,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 22:43:35,561 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:35,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 234 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-14 22:43:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2021-12-14 22:43:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.386138613861386) internal successors, (140), 113 states have internal predecessors, (140), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2021-12-14 22:43:35,572 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 19 [2021-12-14 22:43:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:35,572 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2021-12-14 22:43:35,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 22:43:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2021-12-14 22:43:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 22:43:35,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:35,573 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:35,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 22:43:35,573 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash -614250977, now seen corresponding path program 1 times [2021-12-14 22:43:35,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:35,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279502165] [2021-12-14 22:43:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:35,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 22:43:35,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279502165] [2021-12-14 22:43:35,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279502165] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:35,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:35,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:43:35,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395336619] [2021-12-14 22:43:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:35,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:43:35,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:35,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:43:35,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:43:35,608 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 22:43:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:35,658 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2021-12-14 22:43:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 22:43:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2021-12-14 22:43:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:35,659 INFO L225 Difference]: With dead ends: 139 [2021-12-14 22:43:35,659 INFO L226 Difference]: Without dead ends: 137 [2021-12-14 22:43:35,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:43:35,660 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:35,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 277 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-14 22:43:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2021-12-14 22:43:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 107 states have internal predecessors, (132), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-12-14 22:43:35,666 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 23 [2021-12-14 22:43:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:35,666 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-12-14 22:43:35,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 22:43:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-12-14 22:43:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 22:43:35,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:35,667 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:35,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 22:43:35,668 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash -997219449, now seen corresponding path program 1 times [2021-12-14 22:43:35,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:35,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857785234] [2021-12-14 22:43:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:35,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 22:43:35,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:35,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857785234] [2021-12-14 22:43:35,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857785234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:35,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:35,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 22:43:35,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401795635] [2021-12-14 22:43:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:35,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 22:43:35,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:35,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 22:43:35,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 22:43:35,703 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 22:43:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:35,738 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2021-12-14 22:43:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 22:43:35,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-12-14 22:43:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:35,739 INFO L225 Difference]: With dead ends: 133 [2021-12-14 22:43:35,740 INFO L226 Difference]: Without dead ends: 131 [2021-12-14 22:43:35,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 22:43:35,740 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:35,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 277 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-14 22:43:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2021-12-14 22:43:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.351063829787234) internal successors, (127), 102 states have internal predecessors, (127), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 22:43:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2021-12-14 22:43:35,746 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 25 [2021-12-14 22:43:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:35,747 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2021-12-14 22:43:35,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 22:43:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2021-12-14 22:43:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 22:43:35,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:35,748 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:35,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 22:43:35,748 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1249154163, now seen corresponding path program 1 times [2021-12-14 22:43:35,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:35,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212194634] [2021-12-14 22:43:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:35,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 22:43:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:43:35,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:35,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212194634] [2021-12-14 22:43:35,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212194634] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:35,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411110037] [2021-12-14 22:43:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:35,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:35,848 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) [2021-12-14 22:43:35,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 22:43:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:35,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-14 22:43:35,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 22:43:36,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:43:36,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411110037] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:36,205 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:36,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2021-12-14 22:43:36,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124302658] [2021-12-14 22:43:36,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:36,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 22:43:36,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:36,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 22:43:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-12-14 22:43:36,209 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 22:43:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:36,459 INFO L93 Difference]: Finished difference Result 262 states and 321 transitions. [2021-12-14 22:43:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 22:43:36,460 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2021-12-14 22:43:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:36,462 INFO L225 Difference]: With dead ends: 262 [2021-12-14 22:43:36,463 INFO L226 Difference]: Without dead ends: 153 [2021-12-14 22:43:36,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-12-14 22:43:36,465 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 60 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:36,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 799 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-14 22:43:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 103. [2021-12-14 22:43:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 88 states have internal predecessors, (105), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-14 22:43:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2021-12-14 22:43:36,474 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 29 [2021-12-14 22:43:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:36,476 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2021-12-14 22:43:36,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 22:43:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2021-12-14 22:43:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 22:43:36,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:36,479 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:36,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:36,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 22:43:36,696 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1266015036, now seen corresponding path program 1 times [2021-12-14 22:43:36,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:36,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267680273] [2021-12-14 22:43:36,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:36,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 22:43:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:43:36,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:36,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267680273] [2021-12-14 22:43:36,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267680273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:36,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:36,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 22:43:36,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764726781] [2021-12-14 22:43:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:36,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 22:43:36,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:36,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 22:43:36,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 22:43:36,825 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 22:43:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:36,872 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2021-12-14 22:43:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 22:43:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-12-14 22:43:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:36,874 INFO L225 Difference]: With dead ends: 166 [2021-12-14 22:43:36,874 INFO L226 Difference]: Without dead ends: 124 [2021-12-14 22:43:36,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 22:43:36,875 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 12 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:36,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 583 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 22:43:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-14 22:43:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2021-12-14 22:43:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 97 states have internal predecessors, (113), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2021-12-14 22:43:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2021-12-14 22:43:36,880 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 33 [2021-12-14 22:43:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:36,881 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2021-12-14 22:43:36,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 22:43:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2021-12-14 22:43:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 22:43:36,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:36,881 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:36,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 22:43:36,882 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:36,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:36,882 INFO L85 PathProgramCache]: Analyzing trace with hash 700268352, now seen corresponding path program 1 times [2021-12-14 22:43:36,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:36,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546574596] [2021-12-14 22:43:36,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:36,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 22:43:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 22:43:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:43:36,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:36,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546574596] [2021-12-14 22:43:36,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546574596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:36,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:36,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 22:43:36,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211742748] [2021-12-14 22:43:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:36,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 22:43:36,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 22:43:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 22:43:36,946 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 22:43:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:37,052 INFO L93 Difference]: Finished difference Result 184 states and 215 transitions. [2021-12-14 22:43:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 22:43:37,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2021-12-14 22:43:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:37,053 INFO L225 Difference]: With dead ends: 184 [2021-12-14 22:43:37,053 INFO L226 Difference]: Without dead ends: 144 [2021-12-14 22:43:37,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-14 22:43:37,054 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 71 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:37,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 623 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-14 22:43:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2021-12-14 22:43:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.308411214953271) internal successors, (140), 116 states have internal predecessors, (140), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2021-12-14 22:43:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions. [2021-12-14 22:43:37,060 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 37 [2021-12-14 22:43:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:37,075 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 167 transitions. [2021-12-14 22:43:37,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 22:43:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions. [2021-12-14 22:43:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 22:43:37,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:37,076 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:37,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 22:43:37,077 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1158132499, now seen corresponding path program 2 times [2021-12-14 22:43:37,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:37,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422097551] [2021-12-14 22:43:37,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:37,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 22:43:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 22:43:37,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:37,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422097551] [2021-12-14 22:43:37,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422097551] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:37,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:37,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 22:43:37,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625353485] [2021-12-14 22:43:37,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:37,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 22:43:37,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:37,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 22:43:37,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 22:43:37,205 INFO L87 Difference]: Start difference. First operand 137 states and 167 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 22:43:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:37,334 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2021-12-14 22:43:37,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 22:43:37,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2021-12-14 22:43:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:37,336 INFO L225 Difference]: With dead ends: 257 [2021-12-14 22:43:37,336 INFO L226 Difference]: Without dead ends: 215 [2021-12-14 22:43:37,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-14 22:43:37,337 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 152 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:37,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 1007 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-12-14 22:43:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2021-12-14 22:43:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 142 states have (on average 1.323943661971831) internal successors, (188), 152 states have internal predecessors, (188), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-14 22:43:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 225 transitions. [2021-12-14 22:43:37,358 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 225 transitions. Word has length 37 [2021-12-14 22:43:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:37,358 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 225 transitions. [2021-12-14 22:43:37,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 22:43:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 225 transitions. [2021-12-14 22:43:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 22:43:37,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:37,359 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:37,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 22:43:37,360 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1158072917, now seen corresponding path program 1 times [2021-12-14 22:43:37,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:37,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114203017] [2021-12-14 22:43:37,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:37,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 22:43:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 22:43:37,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114203017] [2021-12-14 22:43:37,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114203017] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471736791] [2021-12-14 22:43:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:37,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:37,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:37,496 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) [2021-12-14 22:43:37,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 22:43:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:37,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 22:43:37,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 22:43:37,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 22:43:37,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471736791] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:37,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:37,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2021-12-14 22:43:37,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175646104] [2021-12-14 22:43:37,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:37,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 22:43:37,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:37,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 22:43:37,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-12-14 22:43:37,813 INFO L87 Difference]: Start difference. First operand 179 states and 225 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-14 22:43:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:38,047 INFO L93 Difference]: Finished difference Result 337 states and 426 transitions. [2021-12-14 22:43:38,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 22:43:38,047 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2021-12-14 22:43:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:38,049 INFO L225 Difference]: With dead ends: 337 [2021-12-14 22:43:38,049 INFO L226 Difference]: Without dead ends: 277 [2021-12-14 22:43:38,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-12-14 22:43:38,050 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:38,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 1218 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-14 22:43:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 236. [2021-12-14 22:43:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 200 states have internal predecessors, (255), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (30), 23 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-14 22:43:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 309 transitions. [2021-12-14 22:43:38,063 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 309 transitions. Word has length 37 [2021-12-14 22:43:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:38,063 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 309 transitions. [2021-12-14 22:43:38,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-14 22:43:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 309 transitions. [2021-12-14 22:43:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 22:43:38,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:38,065 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:38,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:38,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:38,284 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1294716000, now seen corresponding path program 1 times [2021-12-14 22:43:38,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:38,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717055074] [2021-12-14 22:43:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:38,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:38,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 22:43:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 22:43:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:43:38,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:38,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717055074] [2021-12-14 22:43:38,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717055074] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 22:43:38,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436471051] [2021-12-14 22:43:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:38,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 22:43:38,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 22:43:38,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 22:43:38,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 22:43:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:38,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 22:43:38,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 22:43:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 22:43:38,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 22:43:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 22:43:38,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436471051] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 22:43:38,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 22:43:38,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2021-12-14 22:43:38,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138120411] [2021-12-14 22:43:38,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 22:43:38,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 22:43:38,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:38,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 22:43:38,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-12-14 22:43:38,600 INFO L87 Difference]: Start difference. First operand 236 states and 309 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 22:43:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:38,788 INFO L93 Difference]: Finished difference Result 350 states and 450 transitions. [2021-12-14 22:43:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 22:43:38,788 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2021-12-14 22:43:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:38,790 INFO L225 Difference]: With dead ends: 350 [2021-12-14 22:43:38,790 INFO L226 Difference]: Without dead ends: 256 [2021-12-14 22:43:38,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-12-14 22:43:38,791 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:38,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 853 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-14 22:43:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 215. [2021-12-14 22:43:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 184 states have internal predecessors, (237), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) [2021-12-14 22:43:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2021-12-14 22:43:38,802 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 39 [2021-12-14 22:43:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:38,802 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2021-12-14 22:43:38,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 22:43:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2021-12-14 22:43:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 22:43:38,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:38,803 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:38,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 22:43:39,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 22:43:39,020 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -838128895, now seen corresponding path program 1 times [2021-12-14 22:43:39,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:39,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499904609] [2021-12-14 22:43:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:39,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 22:43:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 22:43:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 22:43:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 22:43:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 22:43:39,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 22:43:39,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499904609] [2021-12-14 22:43:39,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499904609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 22:43:39,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 22:43:39,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 22:43:39,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132350820] [2021-12-14 22:43:39,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 22:43:39,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 22:43:39,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 22:43:39,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 22:43:39,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 22:43:39,190 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 22:43:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 22:43:39,428 INFO L93 Difference]: Finished difference Result 248 states and 312 transitions. [2021-12-14 22:43:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 22:43:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-12-14 22:43:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 22:43:39,429 INFO L225 Difference]: With dead ends: 248 [2021-12-14 22:43:39,429 INFO L226 Difference]: Without dead ends: 247 [2021-12-14 22:43:39,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-14 22:43:39,430 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 206 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 22:43:39,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 689 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 22:43:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-14 22:43:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 215. [2021-12-14 22:43:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 184 states have internal predecessors, (236), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) [2021-12-14 22:43:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2021-12-14 22:43:39,440 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 39 [2021-12-14 22:43:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 22:43:39,440 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2021-12-14 22:43:39,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 22:43:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2021-12-14 22:43:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 22:43:39,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 22:43:39,441 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:39,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 22:43:39,442 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-14 22:43:39,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 22:43:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1741690569, now seen corresponding path program 1 times [2021-12-14 22:43:39,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 22:43:39,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663658250] [2021-12-14 22:43:39,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 22:43:39,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 22:43:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 22:43:39,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 22:43:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 22:43:39,486 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 22:43:39,486 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 22:43:39,487 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2021-12-14 22:43:39,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2021-12-14 22:43:39,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2021-12-14 22:43:39,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2021-12-14 22:43:39,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2021-12-14 22:43:39,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2021-12-14 22:43:39,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2021-12-14 22:43:39,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2021-12-14 22:43:39,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2021-12-14 22:43:39,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2021-12-14 22:43:39,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2021-12-14 22:43:39,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2021-12-14 22:43:39,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2021-12-14 22:43:39,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2021-12-14 22:43:39,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2021-12-14 22:43:39,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2021-12-14 22:43:39,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 22:43:39,493 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 22:43:39,495 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 22:43:39,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 10:43:39 BoogieIcfgContainer [2021-12-14 22:43:39,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 22:43:39,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 22:43:39,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 22:43:39,519 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 22:43:39,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:43:33" (3/4) ... [2021-12-14 22:43:39,522 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 22:43:39,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 22:43:39,522 INFO L158 Benchmark]: Toolchain (without parser) took 6458.66ms. Allocated memory was 115.3MB in the beginning and 182.5MB in the end (delta: 67.1MB). Free memory was 84.6MB in the beginning and 140.0MB in the end (delta: -55.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-14 22:43:39,522 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 22:43:39,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.14ms. Allocated memory is still 115.3MB. Free memory was 84.3MB in the beginning and 88.1MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 22:43:39,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.40ms. Allocated memory is still 115.3MB. Free memory was 88.1MB in the beginning and 86.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 22:43:39,523 INFO L158 Benchmark]: Boogie Preprocessor took 37.50ms. Allocated memory is still 115.3MB. Free memory was 86.5MB in the beginning and 85.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 22:43:39,523 INFO L158 Benchmark]: RCFGBuilder took 352.98ms. Allocated memory is still 115.3MB. Free memory was 85.3MB in the beginning and 71.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 22:43:39,523 INFO L158 Benchmark]: TraceAbstraction took 5665.99ms. Allocated memory was 115.3MB in the beginning and 182.5MB in the end (delta: 67.1MB). Free memory was 71.0MB in the beginning and 140.0MB in the end (delta: -69.0MB). Peak memory consumption was 228.9kB. Max. memory is 16.1GB. [2021-12-14 22:43:39,523 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 182.5MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 22:43:39,524 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 86.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.14ms. Allocated memory is still 115.3MB. Free memory was 84.3MB in the beginning and 88.1MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.40ms. Allocated memory is still 115.3MB. Free memory was 88.1MB in the beginning and 86.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.50ms. Allocated memory is still 115.3MB. Free memory was 86.5MB in the beginning and 85.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.98ms. Allocated memory is still 115.3MB. Free memory was 85.3MB in the beginning and 71.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5665.99ms. Allocated memory was 115.3MB in the beginning and 182.5MB in the end (delta: 67.1MB). Free memory was 71.0MB in the beginning and 140.0MB in the end (delta: -69.0MB). Peak memory consumption was 228.9kB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 182.5MB. Free memory is still 140.0MB. 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: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 111, overapproximation of bitwiseAnd at line 112. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=127, eb=0] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L242] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L243] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, zero=0] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L30] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L58] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L78] EXPR e + 128 [L78] res = m | ((unsigned int )(e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=1, e=0, res=1] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=36028797018963969, __retres4=1, e=0, res=1] [L244] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=36028797018963969, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=1] [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L95] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L110] EXPR (int )(a >> 24U) - 128 [L110] ea = (int )(a >> 24U) - 128 [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127] [L113] (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127] - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 110]: 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: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: 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 4 procedures, 84 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1195 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1169 mSDsluCounter, 8402 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6884 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 1518 mSDtfsCounter, 1528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 277 SyntacticMatches, 5 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=16, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 396 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1829 SizeOfPredicates, 11 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 214/259 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 [2021-12-14 22:43:39,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample