./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 20:50:09,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 20:50:09,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 20:50:09,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 20:50:09,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 20:50:09,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 20:50:09,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 20:50:09,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 20:50:09,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 20:50:09,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 20:50:09,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 20:50:09,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 20:50:09,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 20:50:09,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 20:50:09,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 20:50:09,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 20:50:09,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 20:50:09,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 20:50:09,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 20:50:09,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 20:50:09,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 20:50:09,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 20:50:09,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 20:50:09,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 20:50:09,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 20:50:09,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 20:50:09,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 20:50:09,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 20:50:09,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 20:50:09,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 20:50:09,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 20:50:09,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 20:50:09,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 20:50:09,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 20:50:09,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 20:50:09,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 20:50:09,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 20:50:09,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 20:50:09,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 20:50:09,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 20:50:09,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 20:50:09,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-21 20:50:09,376 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 20:50:09,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 20:50:09,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 20:50:09,377 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 20:50:09,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 20:50:09,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 20:50:09,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 20:50:09,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 20:50:09,385 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 20:50:09,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 20:50:09,386 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 20:50:09,387 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 20:50:09,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 20:50:09,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 20:50:09,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 20:50:09,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 20:50:09,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 20:50:09,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 20:50:09,388 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-21 20:50:09,388 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 20:50:09,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 20:50:09,389 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 20:50:09,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 20:50:09,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 20:50:09,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 20:50:09,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 20:50:09,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:50:09,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 20:50:09,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 20:50:09,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 20:50:09,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 20:50:09,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 20:50:09,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 20:50:09,392 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 20:50:09,393 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2021-12-21 20:50:09,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 20:50:09,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 20:50:09,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 20:50:09,675 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 20:50:09,676 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 20:50:09,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2021-12-21 20:50:09,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73be2d7f/85c2d8860e8f4e2d8587b06202079a97/FLAG8778e8923 [2021-12-21 20:50:10,202 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 20:50:10,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2021-12-21 20:50:10,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73be2d7f/85c2d8860e8f4e2d8587b06202079a97/FLAG8778e8923 [2021-12-21 20:50:10,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73be2d7f/85c2d8860e8f4e2d8587b06202079a97 [2021-12-21 20:50:10,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 20:50:10,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 20:50:10,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 20:50:10,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 20:50:10,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 20:50:10,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f235b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10, skipping insertion in model container [2021-12-21 20:50:10,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 20:50:10,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:50:10,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2021-12-21 20:50:10,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:50:10,488 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 20:50:10,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2021-12-21 20:50:10,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:50:10,535 INFO L208 MainTranslator]: Completed translation [2021-12-21 20:50:10,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10 WrapperNode [2021-12-21 20:50:10,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 20:50:10,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 20:50:10,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 20:50:10,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 20:50:10,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,573 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 158 [2021-12-21 20:50:10,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 20:50:10,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 20:50:10,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 20:50:10,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 20:50:10,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 20:50:10,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 20:50:10,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 20:50:10,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 20:50:10,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:50:10,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:10,643 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-21 20:50:10,650 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-21 20:50:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 20:50:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 20:50:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2021-12-21 20:50:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2021-12-21 20:50:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 20:50:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 20:50:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-21 20:50:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-21 20:50:10,754 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 20:50:10,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 20:50:11,062 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 20:50:11,066 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 20:50:11,069 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 20:50:11,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:11 BoogieIcfgContainer [2021-12-21 20:50:11,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 20:50:11,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 20:50:11,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 20:50:11,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 20:50:11,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:50:10" (1/3) ... [2021-12-21 20:50:11,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1821af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:50:11, skipping insertion in model container [2021-12-21 20:50:11,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (2/3) ... [2021-12-21 20:50:11,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1821af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:50:11, skipping insertion in model container [2021-12-21 20:50:11,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:11" (3/3) ... [2021-12-21 20:50:11,078 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2021-12-21 20:50:11,082 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 20:50:11,082 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-12-21 20:50:11,122 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 20:50:11,132 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-21 20:50:11,133 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-12-21 20:50:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 75 states have (on average 1.68) internal successors, (126), 93 states have internal predecessors, (126), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-21 20:50:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 20:50:11,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,168 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1415508078, now seen corresponding path program 1 times [2021-12-21 20:50:11,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174943665] [2021-12-21 20:50:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,350 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-21 20:50:11,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174943665] [2021-12-21 20:50:11,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174943665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:50:11,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761888289] [2021-12-21 20:50:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 20:50:11,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 20:50:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 20:50:11,382 INFO L87 Difference]: Start difference. First operand has 102 states, 75 states have (on average 1.68) internal successors, (126), 93 states have internal predecessors, (126), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:50:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,422 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2021-12-21 20:50:11,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 20:50:11,425 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-21 20:50:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,433 INFO L225 Difference]: With dead ends: 199 [2021-12-21 20:50:11,433 INFO L226 Difference]: Without dead ends: 72 [2021-12-21 20:50:11,437 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-21 20:50:11,441 INFO L933 BasicCegarLoop]: 134 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, 134 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-21 20:50:11,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-21 20:50:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-21 20:50:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 64 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2021-12-21 20:50:11,481 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 9 [2021-12-21 20:50:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,481 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2021-12-21 20:50:11,481 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-21 20:50:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2021-12-21 20:50:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 20:50:11,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 20:50:11,484 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1416449344, now seen corresponding path program 1 times [2021-12-21 20:50:11,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724468322] [2021-12-21 20:50:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,561 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-21 20:50:11,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724468322] [2021-12-21 20:50:11,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724468322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:50:11,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753890145] [2021-12-21 20:50:11,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:11,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:11,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:50:11,566 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-21 20:50:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,651 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2021-12-21 20:50:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:11,652 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-21 20:50:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,654 INFO L225 Difference]: With dead ends: 181 [2021-12-21 20:50:11,654 INFO L226 Difference]: Without dead ends: 112 [2021-12-21 20:50:11,655 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-21 20:50:11,656 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:11,657 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.1s Time] [2021-12-21 20:50:11,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-21 20:50:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2021-12-21 20:50:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 94 states have internal predecessors, (119), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2021-12-21 20:50:11,666 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 9 [2021-12-21 20:50:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,666 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2021-12-21 20:50:11,666 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-21 20:50:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2021-12-21 20:50:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 20:50:11,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 20:50:11,668 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1771450567, now seen corresponding path program 1 times [2021-12-21 20:50:11,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679504130] [2021-12-21 20:50:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,700 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-21 20:50:11,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679504130] [2021-12-21 20:50:11,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679504130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:11,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539441679] [2021-12-21 20:50:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:11,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:11,703 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-21 20:50:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,759 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2021-12-21 20:50:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:11,760 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-21 20:50:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,761 INFO L225 Difference]: With dead ends: 122 [2021-12-21 20:50:11,761 INFO L226 Difference]: Without dead ends: 120 [2021-12-21 20:50:11,762 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-21 20:50:11,762 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-21 20:50:11,763 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-21 20:50:11,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-21 20:50:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2021-12-21 20:50:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 96 states have internal predecessors, (120), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2021-12-21 20:50:11,772 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 13 [2021-12-21 20:50:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,772 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2021-12-21 20:50:11,772 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-21 20:50:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2021-12-21 20:50:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 20:50:11,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 20:50:11,773 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -919607170, now seen corresponding path program 1 times [2021-12-21 20:50:11,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424077635] [2021-12-21 20:50:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,805 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-21 20:50:11,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424077635] [2021-12-21 20:50:11,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424077635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:11,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400732822] [2021-12-21 20:50:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:11,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:11,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:11,807 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-21 20:50:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,867 INFO L93 Difference]: Finished difference Result 198 states and 237 transitions. [2021-12-21 20:50:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:11,867 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-21 20:50:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,868 INFO L225 Difference]: With dead ends: 198 [2021-12-21 20:50:11,868 INFO L226 Difference]: Without dead ends: 126 [2021-12-21 20:50:11,869 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-21 20:50:11,870 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:11,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 309 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-21 20:50:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2021-12-21 20:50:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 100 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2021-12-21 20:50:11,878 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 14 [2021-12-21 20:50:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,878 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2021-12-21 20:50:11,878 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-21 20:50:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2021-12-21 20:50:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 20:50:11,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,879 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 20:50:11,880 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 148928534, now seen corresponding path program 1 times [2021-12-21 20:50:11,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917401604] [2021-12-21 20:50:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,915 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-21 20:50:11,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917401604] [2021-12-21 20:50:11,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917401604] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:11,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595581291] [2021-12-21 20:50:11,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:11,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:11,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:11,917 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-21 20:50:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,967 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2021-12-21 20:50:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:11,968 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-21 20:50:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,969 INFO L225 Difference]: With dead ends: 150 [2021-12-21 20:50:11,969 INFO L226 Difference]: Without dead ends: 147 [2021-12-21 20:50:11,969 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-21 20:50:11,970 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 243 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-21 20:50:11,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 243 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-21 20:50:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2021-12-21 20:50:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 120 states have internal predecessors, (154), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2021-12-21 20:50:11,979 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 16 [2021-12-21 20:50:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,979 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2021-12-21 20:50:11,979 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-21 20:50:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2021-12-21 20:50:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 20:50:11,980 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,980 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 20:50:11,981 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash -61703120, now seen corresponding path program 1 times [2021-12-21 20:50:11,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797242149] [2021-12-21 20:50:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,008 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-21 20:50:12,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797242149] [2021-12-21 20:50:12,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797242149] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:12,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236145192] [2021-12-21 20:50:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:12,017 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-21 20:50:12,019 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-21 20:50:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:50:12,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:12,112 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-21 20:50:12,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:50:12,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236145192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:50:12,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-21 20:50:12,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961955305] [2021-12-21 20:50:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:12,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:50:12,115 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-21 20:50:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,142 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2021-12-21 20:50:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:12,142 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-21 20:50:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,143 INFO L225 Difference]: With dead ends: 158 [2021-12-21 20:50:12,144 INFO L226 Difference]: Without dead ends: 157 [2021-12-21 20:50:12,144 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-21 20:50:12,145 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-21 20:50:12,145 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-21 20:50:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-21 20:50:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 128. [2021-12-21 20:50:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 118 states have internal predecessors, (150), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2021-12-21 20:50:12,153 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 15 [2021-12-21 20:50:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,154 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2021-12-21 20:50:12,154 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-21 20:50:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2021-12-21 20:50:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-21 20:50:12,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,155 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,190 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-21 20:50:12,387 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-21 20:50:12,388 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 321817315, now seen corresponding path program 1 times [2021-12-21 20:50:12,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808660859] [2021-12-21 20:50:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,436 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-21 20:50:12,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808660859] [2021-12-21 20:50:12,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808660859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:50:12,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906705782] [2021-12-21 20:50:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:50:12,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:50:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:50:12,439 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-21 20:50:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,468 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2021-12-21 20:50:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:50:12,469 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-21 20:50:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,470 INFO L225 Difference]: With dead ends: 137 [2021-12-21 20:50:12,470 INFO L226 Difference]: Without dead ends: 136 [2021-12-21 20:50:12,470 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-21 20:50:12,471 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-21 20:50:12,471 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-21 20:50:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-21 20:50:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2021-12-21 20:50:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 115 states have internal predecessors, (145), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2021-12-21 20:50:12,493 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 17 [2021-12-21 20:50:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,493 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2021-12-21 20:50:12,493 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-21 20:50:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2021-12-21 20:50:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 20:50:12,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,494 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 20:50:12,494 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2021116994, now seen corresponding path program 1 times [2021-12-21 20:50:12,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011778243] [2021-12-21 20:50:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,537 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-21 20:50:12,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011778243] [2021-12-21 20:50:12,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011778243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:12,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138219136] [2021-12-21 20:50:12,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:12,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:12,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:12,538 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-21 20:50:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,586 INFO L93 Difference]: Finished difference Result 145 states and 174 transitions. [2021-12-21 20:50:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:12,586 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-21 20:50:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,587 INFO L225 Difference]: With dead ends: 145 [2021-12-21 20:50:12,587 INFO L226 Difference]: Without dead ends: 143 [2021-12-21 20:50:12,587 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-21 20:50:12,588 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 88 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 242 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-21 20:50:12,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 242 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-21 20:50:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2021-12-21 20:50:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 118 states have internal predecessors, (147), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2021-12-21 20:50:12,595 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 18 [2021-12-21 20:50:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,595 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2021-12-21 20:50:12,595 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-21 20:50:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2021-12-21 20:50:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-21 20:50:12,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,596 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 20:50:12,596 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash 409167280, now seen corresponding path program 1 times [2021-12-21 20:50:12,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016984390] [2021-12-21 20:50:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,617 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-21 20:50:12,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016984390] [2021-12-21 20:50:12,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016984390] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:50:12,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627085358] [2021-12-21 20:50:12,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:12,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:50:12,619 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-21 20:50:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,645 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2021-12-21 20:50:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:12,645 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-21 20:50:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,646 INFO L225 Difference]: With dead ends: 157 [2021-12-21 20:50:12,646 INFO L226 Difference]: Without dead ends: 156 [2021-12-21 20:50:12,646 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-21 20:50:12,647 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:12,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 164 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-21 20:50:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2021-12-21 20:50:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.375) internal successors, (143), 115 states have internal predecessors, (143), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2021-12-21 20:50:12,659 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 19 [2021-12-21 20:50:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,659 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2021-12-21 20:50:12,660 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-21 20:50:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2021-12-21 20:50:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 20:50:12,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,660 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-21 20:50:12,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 20:50:12,661 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,661 INFO L85 PathProgramCache]: Analyzing trace with hash 439866434, now seen corresponding path program 1 times [2021-12-21 20:50:12,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995038368] [2021-12-21 20:50:12,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,695 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-21 20:50:12,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995038368] [2021-12-21 20:50:12,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995038368] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:12,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570394977] [2021-12-21 20:50:12,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:12,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:12,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:12,696 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-21 20:50:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,738 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2021-12-21 20:50:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:12,739 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-21 20:50:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,740 INFO L225 Difference]: With dead ends: 139 [2021-12-21 20:50:12,740 INFO L226 Difference]: Without dead ends: 137 [2021-12-21 20:50:12,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-21 20:50:12,740 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 94 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 239 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-21 20:50:12,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 239 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-21 20:50:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2021-12-21 20:50:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.35) internal successors, (135), 109 states have internal predecessors, (135), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-12-21 20:50:12,747 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 23 [2021-12-21 20:50:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,747 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-12-21 20:50:12,748 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-21 20:50:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-12-21 20:50:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 20:50:12,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,748 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-21 20:50:12,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 20:50:12,749 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1602669334, now seen corresponding path program 1 times [2021-12-21 20:50:12,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598831244] [2021-12-21 20:50:12,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,784 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-21 20:50:12,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598831244] [2021-12-21 20:50:12,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598831244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:12,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836593126] [2021-12-21 20:50:12,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:12,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:12,785 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-21 20:50:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,841 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2021-12-21 20:50:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:12,841 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-21 20:50:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,842 INFO L225 Difference]: With dead ends: 133 [2021-12-21 20:50:12,842 INFO L226 Difference]: Without dead ends: 131 [2021-12-21 20:50:12,842 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-21 20:50:12,843 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 84 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 239 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-21 20:50:12,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 239 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-21 20:50:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2021-12-21 20:50:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 104 states have internal predecessors, (130), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2021-12-21 20:50:12,849 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 25 [2021-12-21 20:50:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,849 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2021-12-21 20:50:12,849 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-21 20:50:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2021-12-21 20:50:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 20:50:12,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,850 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 20:50:12,850 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2138065319, now seen corresponding path program 1 times [2021-12-21 20:50:12,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461869485] [2021-12-21 20:50:12,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:50:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,919 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-21 20:50:12,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461869485] [2021-12-21 20:50:12,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461869485] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963141160] [2021-12-21 20:50:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:12,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:12,920 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-21 20:50:12,921 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-21 20:50:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-21 20:50:12,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:13,064 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-21 20:50:13,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:13,228 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-21 20:50:13,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963141160] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:13,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:13,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2021-12-21 20:50:13,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092219683] [2021-12-21 20:50:13,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:13,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-21 20:50:13,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:13,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-21 20:50:13,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-12-21 20:50:13,229 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 20:50:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:13,474 INFO L93 Difference]: Finished difference Result 256 states and 316 transitions. [2021-12-21 20:50:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 20:50:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2021-12-21 20:50:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:13,475 INFO L225 Difference]: With dead ends: 256 [2021-12-21 20:50:13,475 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 20:50:13,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2021-12-21 20:50:13,476 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 38 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:13,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 696 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 20:50:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2021-12-21 20:50:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 80 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2021-12-21 20:50:13,484 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 30 [2021-12-21 20:50:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:13,484 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2021-12-21 20:50:13,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 20:50:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2021-12-21 20:50:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 20:50:13,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:13,485 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:13,526 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-21 20:50:13,704 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-21 20:50:13,704 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:13,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash -361225462, now seen corresponding path program 1 times [2021-12-21 20:50:13,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:13,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589509299] [2021-12-21 20:50:13,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:13,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 20:50:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 20:50:13,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:13,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589509299] [2021-12-21 20:50:13,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589509299] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:13,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140818168] [2021-12-21 20:50:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:13,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:13,788 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-21 20:50:13,789 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-21 20:50:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 20:50:13,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 20:50:13,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 20:50:14,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140818168] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:14,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:14,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2021-12-21 20:50:14,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723598415] [2021-12-21 20:50:14,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:14,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 20:50:14,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:14,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 20:50:14,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:50:14,078 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 20:50:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:14,324 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2021-12-21 20:50:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 20:50:14,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 34 [2021-12-21 20:50:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:14,325 INFO L225 Difference]: With dead ends: 161 [2021-12-21 20:50:14,325 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 20:50:14,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-12-21 20:50:14,328 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 115 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:14,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 537 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 20:50:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2021-12-21 20:50:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 80 states have internal predecessors, (94), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2021-12-21 20:50:14,338 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 34 [2021-12-21 20:50:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:14,339 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2021-12-21 20:50:14,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 20:50:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2021-12-21 20:50:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 20:50:14,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:14,341 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:14,361 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-21 20:50:14,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:14,556 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 934680810, now seen corresponding path program 1 times [2021-12-21 20:50:14,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:14,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537206007] [2021-12-21 20:50:14,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:14,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 20:50:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,642 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-21 20:50:14,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:14,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537206007] [2021-12-21 20:50:14,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537206007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:14,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:14,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:50:14,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394386423] [2021-12-21 20:50:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:14,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:50:14,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:50:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:50:14,644 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:14,702 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2021-12-21 20:50:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 20:50:14,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-12-21 20:50:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:14,704 INFO L225 Difference]: With dead ends: 137 [2021-12-21 20:50:14,705 INFO L226 Difference]: Without dead ends: 90 [2021-12-21 20:50:14,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:50:14,705 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:14,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 420 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-21 20:50:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-21 20:50:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 80 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:50:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2021-12-21 20:50:14,712 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 38 [2021-12-21 20:50:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:14,712 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2021-12-21 20:50:14,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2021-12-21 20:50:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 20:50:14,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:14,713 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:14,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 20:50:14,713 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash 702777177, now seen corresponding path program 2 times [2021-12-21 20:50:14,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:14,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117753948] [2021-12-21 20:50:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:14,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 20:50:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,825 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-21 20:50:14,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:14,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117753948] [2021-12-21 20:50:14,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117753948] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:14,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931372774] [2021-12-21 20:50:14,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:50:14,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:14,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:14,840 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-21 20:50:14,841 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-21 20:50:14,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:50:14,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:50:14,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 20:50:14,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:15,022 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-21 20:50:15,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:50:15,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931372774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:15,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:50:15,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2021-12-21 20:50:15,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905734781] [2021-12-21 20:50:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:15,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 20:50:15,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:15,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 20:50:15,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:50:15,023 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:15,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:15,136 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2021-12-21 20:50:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:50:15,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-12-21 20:50:15,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:15,138 INFO L225 Difference]: With dead ends: 159 [2021-12-21 20:50:15,138 INFO L226 Difference]: Without dead ends: 157 [2021-12-21 20:50:15,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:50:15,138 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 101 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:15,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 583 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-21 20:50:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2021-12-21 20:50:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.25) internal successors, (115), 99 states have internal predecessors, (115), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-21 20:50:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2021-12-21 20:50:15,148 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 42 [2021-12-21 20:50:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:15,149 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2021-12-21 20:50:15,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2021-12-21 20:50:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 20:50:15,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:15,150 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:15,178 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-21 20:50:15,368 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,SelfDestructingSolverStorable14 [2021-12-21 20:50:15,368 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash 702836759, now seen corresponding path program 1 times [2021-12-21 20:50:15,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:15,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861587250] [2021-12-21 20:50:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:15,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 20:50:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:15,484 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-21 20:50:15,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:15,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861587250] [2021-12-21 20:50:15,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861587250] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:15,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132974539] [2021-12-21 20:50:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:15,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:15,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:15,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:50:15,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 20:50:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:15,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 20:50:15,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:15,650 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-21 20:50:15,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:15,830 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-21 20:50:15,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132974539] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:15,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:15,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2021-12-21 20:50:15,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136603991] [2021-12-21 20:50:15,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:15,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 20:50:15,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:15,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 20:50:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-21 20:50:15,832 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 20:50:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:15,943 INFO L93 Difference]: Finished difference Result 198 states and 227 transitions. [2021-12-21 20:50:15,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:50:15,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2021-12-21 20:50:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:15,945 INFO L225 Difference]: With dead ends: 198 [2021-12-21 20:50:15,945 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 20:50:15,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:50:15,945 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 150 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:15,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 601 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 20:50:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 136. [2021-12-21 20:50:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 122 states have internal predecessors, (143), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-21 20:50:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2021-12-21 20:50:15,952 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 42 [2021-12-21 20:50:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:15,952 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2021-12-21 20:50:15,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 20:50:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2021-12-21 20:50:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 20:50:15,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:15,952 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:15,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:16,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-21 20:50:16,170 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 445438913, now seen corresponding path program 1 times [2021-12-21 20:50:16,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:16,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509846063] [2021-12-21 20:50:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:16,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 20:50:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:16,320 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-21 20:50:16,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:16,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509846063] [2021-12-21 20:50:16,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509846063] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:16,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:16,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 20:50:16,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327616796] [2021-12-21 20:50:16,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:16,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 20:50:16,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 20:50:16,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:50:16,321 INFO L87 Difference]: Start difference. First operand 136 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:16,462 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2021-12-21 20:50:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:50:16,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2021-12-21 20:50:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:16,463 INFO L225 Difference]: With dead ends: 183 [2021-12-21 20:50:16,463 INFO L226 Difference]: Without dead ends: 182 [2021-12-21 20:50:16,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:50:16,464 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 122 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:16,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 615 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-21 20:50:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 133. [2021-12-21 20:50:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 119 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-21 20:50:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2021-12-21 20:50:16,471 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 44 [2021-12-21 20:50:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:16,471 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2021-12-21 20:50:16,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2021-12-21 20:50:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 20:50:16,471 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:16,472 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:16,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 20:50:16,472 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 991734223, now seen corresponding path program 1 times [2021-12-21 20:50:16,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:16,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545222033] [2021-12-21 20:50:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:16,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:50:16,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 20:50:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:50:16,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 20:50:16,504 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 20:50:16,504 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2021-12-21 20:50:16,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2021-12-21 20:50:16,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2021-12-21 20:50:16,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 20:50:16,509 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:16,510 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 20:50:16,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:50:16 BoogieIcfgContainer [2021-12-21 20:50:16,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 20:50:16,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 20:50:16,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 20:50:16,535 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 20:50:16,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:11" (3/4) ... [2021-12-21 20:50:16,538 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 20:50:16,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 20:50:16,538 INFO L158 Benchmark]: Toolchain (without parser) took 6299.33ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 70.0MB in the beginning and 48.5MB in the end (delta: 21.5MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,538 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:50:16,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.64ms. Allocated memory is still 92.3MB. Free memory was 69.9MB in the beginning and 64.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.93ms. Allocated memory is still 92.3MB. Free memory was 64.4MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,538 INFO L158 Benchmark]: Boogie Preprocessor took 33.95ms. Allocated memory is still 92.3MB. Free memory was 62.3MB in the beginning and 60.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,539 INFO L158 Benchmark]: RCFGBuilder took 459.36ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 44.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,539 INFO L158 Benchmark]: TraceAbstraction took 5461.81ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 43.7MB in the beginning and 48.5MB in the end (delta: -4.8MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,539 INFO L158 Benchmark]: Witness Printer took 2.30ms. Allocated memory is still 134.2MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:50:16,540 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.20ms. Allocated memory is still 92.3MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.64ms. Allocated memory is still 92.3MB. Free memory was 69.9MB in the beginning and 64.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.93ms. Allocated memory is still 92.3MB. Free memory was 64.4MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.95ms. Allocated memory is still 92.3MB. Free memory was 62.3MB in the beginning and 60.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.36ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 44.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5461.81ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 43.7MB in the beginning and 48.5MB in the end (delta: -4.8MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 2.30ms. Allocated memory is still 134.2MB. Free memory is still 48.5MB. 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_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=127, eb=0] [L252] 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] [L252] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0] [L252] zero = base2flt(0, 0) [L253] 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] [L253] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, zero=0] [L253] a = base2flt(ma, ea) [L254] 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=-36028797018963967, __retres4=1, e=0, res=1] [L254] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=-36028797018963967, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L264] sa = tmp VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L274] sb = tmp___0 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L277] CALL addflt(a, b) [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 3 procedures, 102 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1161 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1137 mSDsluCounter, 5958 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4612 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1204 IncrementalHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 1346 mSDtfsCounter, 1204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=16, InterpolantAutomatonStates: 117, 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, 17 MinimizatonAttempts, 373 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 617 NumberOfCodeBlocks, 599 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 2016 SizeOfPredicates, 17 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 25 InterpolantComputations, 14 PerfectInterpolantSequences, 200/251 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-21 20:50:16,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample