./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:21:12,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:21:12,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:21:12,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:21:12,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:21:12,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:21:12,183 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:21:12,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:21:12,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:21:12,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:21:12,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:21:12,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:21:12,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:21:12,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:21:12,191 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:21:12,192 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:21:12,193 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:21:12,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:21:12,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:21:12,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:21:12,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:21:12,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:21:12,211 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:21:12,211 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:21:12,211 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:21:12,212 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:21:12,213 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:21:12,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:21:12,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:21:12,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:21:12,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:21:12,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:21:12,215 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:21:12,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:21:12,216 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:21:12,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:21:12,217 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-18 16:21:12,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:21:12,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:21:12,228 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:21:12,228 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:21:12,229 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:21:12,229 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:21:12,229 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:21:12,229 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:21:12,229 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:21:12,229 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:21:12,229 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:21:12,229 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:21:12,230 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:21:12,230 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:21:12,230 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:21:12,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:21:12,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:21:12,231 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:21:12,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:21:12,231 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:21:12,231 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 16:21:12,231 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:21:12,231 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:21:12,231 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:21:12,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:21:12,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:21:12,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:21:12,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:21:12,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:21:12,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:21:12,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:21:12,232 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:21:12,232 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:21:12,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:21:12,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:21:12,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:21:12,233 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2018-11-18 16:21:12,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:21:12,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:21:12,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:21:12,266 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:21:12,267 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:21:12,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 16:21:12,319 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/data/0a97a27f9/50af5c444c214391996ef751f35a04e6/FLAG650b673ad [2018-11-18 16:21:12,666 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:21:12,666 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 16:21:12,671 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/data/0a97a27f9/50af5c444c214391996ef751f35a04e6/FLAG650b673ad [2018-11-18 16:21:13,095 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/data/0a97a27f9/50af5c444c214391996ef751f35a04e6 [2018-11-18 16:21:13,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:21:13,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:21:13,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:21:13,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:21:13,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:21:13,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d28621d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13, skipping insertion in model container [2018-11-18 16:21:13,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:21:13,126 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:21:13,228 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:21:13,231 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:21:13,241 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:21:13,250 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:21:13,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13 WrapperNode [2018-11-18 16:21:13,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:21:13,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:21:13,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:21:13,251 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:21:13,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:21:13,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:21:13,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:21:13,270 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:21:13,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... [2018-11-18 16:21:13,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:21:13,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:21:13,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:21:13,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:21:13,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:21:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:21:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:21:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-18 16:21:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-18 16:21:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-18 16:21:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-18 16:21:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:21:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:21:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:21:13,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:21:13,652 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:21:13,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:13 BoogieIcfgContainer [2018-11-18 16:21:13,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:21:13,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:21:13,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:21:13,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:21:13,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:21:13" (1/3) ... [2018-11-18 16:21:13,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33641f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:21:13, skipping insertion in model container [2018-11-18 16:21:13,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:13" (2/3) ... [2018-11-18 16:21:13,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33641f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:21:13, skipping insertion in model container [2018-11-18 16:21:13,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:13" (3/3) ... [2018-11-18 16:21:13,659 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 16:21:13,667 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:21:13,675 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-18 16:21:13,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-18 16:21:13,710 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:21:13,710 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:21:13,710 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:21:13,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:21:13,711 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:21:13,711 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:21:13,711 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:21:13,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:21:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-18 16:21:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 16:21:13,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:13,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:13,735 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:13,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-18 16:21:13,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:13,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:13,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:13,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:13,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:13,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:13,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:21:13,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:13,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:21:13,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:21:13,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:21:13,936 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-18 16:21:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,020 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-18 16:21:14,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:21:14,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-18 16:21:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,027 INFO L225 Difference]: With dead ends: 49 [2018-11-18 16:21:14,027 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 16:21:14,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:21:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 16:21:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 16:21:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 16:21:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-18 16:21:14,060 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2018-11-18 16:21:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,060 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-18 16:21:14,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:21:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 16:21:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 16:21:14,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,061 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:14,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-18 16:21:14,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:14,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:21:14,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:21:14,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:21:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:14,083 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-11-18 16:21:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,102 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-18 16:21:14,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:21:14,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 16:21:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,104 INFO L225 Difference]: With dead ends: 45 [2018-11-18 16:21:14,104 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 16:21:14,105 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 16:21:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-18 16:21:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 16:21:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-18 16:21:14,112 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-11-18 16:21:14,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,112 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-18 16:21:14,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:21:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-18 16:21:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:21:14,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,112 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:14,114 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1097781535, now seen corresponding path program 1 times [2018-11-18 16:21:14,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:21:14,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:21:14,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:21:14,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:21:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:21:14,185 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-18 16:21:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,371 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-18 16:21:14,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:21:14,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 16:21:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,373 INFO L225 Difference]: With dead ends: 66 [2018-11-18 16:21:14,373 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 16:21:14,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:21:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 16:21:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-11-18 16:21:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 16:21:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-18 16:21:14,381 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 20 [2018-11-18 16:21:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,381 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-18 16:21:14,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:21:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-18 16:21:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:21:14,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,382 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:14,382 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash -328510744, now seen corresponding path program 1 times [2018-11-18 16:21:14,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:21:14,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:21:14,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:21:14,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:21:14,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:14,406 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 3 states. [2018-11-18 16:21:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,418 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-18 16:21:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:21:14,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:21:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,420 INFO L225 Difference]: With dead ends: 62 [2018-11-18 16:21:14,420 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 16:21:14,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 16:21:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-18 16:21:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 16:21:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-11-18 16:21:14,430 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 21 [2018-11-18 16:21:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,430 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-11-18 16:21:14,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:21:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-18 16:21:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:21:14,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,431 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:14,432 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,432 INFO L82 PathProgramCache]: Analyzing trace with hash -271335032, now seen corresponding path program 1 times [2018-11-18 16:21:14,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:21:14,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:21:14,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:21:14,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:21:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:14,462 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2018-11-18 16:21:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,477 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-18 16:21:14,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:21:14,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 16:21:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,478 INFO L225 Difference]: With dead ends: 57 [2018-11-18 16:21:14,478 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 16:21:14,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 16:21:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-18 16:21:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 16:21:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-18 16:21:14,483 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 28 [2018-11-18 16:21:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,483 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-18 16:21:14,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:21:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-18 16:21:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:21:14,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,484 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:14,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash 178548671, now seen corresponding path program 1 times [2018-11-18 16:21:14,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:21:14,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:21:14,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:21:14,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:21:14,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:21:14,524 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-11-18 16:21:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,541 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-11-18 16:21:14,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:21:14,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 16:21:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,542 INFO L225 Difference]: With dead ends: 64 [2018-11-18 16:21:14,542 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 16:21:14,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:21:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 16:21:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-18 16:21:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 16:21:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2018-11-18 16:21:14,552 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 29 [2018-11-18 16:21:14,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,552 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-11-18 16:21:14,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:21:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2018-11-18 16:21:14,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:21:14,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,553 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 16:21:14,555 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1484175368, now seen corresponding path program 1 times [2018-11-18 16:21:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:21:14,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:21:14,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:21:14,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:21:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:14,576 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 3 states. [2018-11-18 16:21:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,586 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-18 16:21:14,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:21:14,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 16:21:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,587 INFO L225 Difference]: With dead ends: 61 [2018-11-18 16:21:14,587 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 16:21:14,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 16:21:14,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-18 16:21:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 16:21:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-18 16:21:14,593 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 28 [2018-11-18 16:21:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,594 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-18 16:21:14,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:21:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-18 16:21:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:21:14,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,595 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 16:21:14,597 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1235203803, now seen corresponding path program 1 times [2018-11-18 16:21:14,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:21:14,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:21:14,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:21:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:21:14,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:21:14,633 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 4 states. [2018-11-18 16:21:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,669 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-11-18 16:21:14,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:21:14,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 16:21:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,671 INFO L225 Difference]: With dead ends: 83 [2018-11-18 16:21:14,671 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 16:21:14,671 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:21:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 16:21:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-11-18 16:21:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 16:21:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-18 16:21:14,679 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 29 [2018-11-18 16:21:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,680 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-18 16:21:14,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:21:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-18 16:21:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 16:21:14,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,681 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:14,681 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1924993580, now seen corresponding path program 1 times [2018-11-18 16:21:14,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:21:14,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:21:14,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:21:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:21:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:21:14,735 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 5 states. [2018-11-18 16:21:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:14,849 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-18 16:21:14,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:21:14,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-18 16:21:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:14,850 INFO L225 Difference]: With dead ends: 93 [2018-11-18 16:21:14,851 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 16:21:14,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:21:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 16:21:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-18 16:21:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 16:21:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-11-18 16:21:14,861 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 33 [2018-11-18 16:21:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:14,862 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-11-18 16:21:14,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:21:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-11-18 16:21:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 16:21:14,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:14,863 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:14,865 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:14,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1290914449, now seen corresponding path program 1 times [2018-11-18 16:21:14,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:14,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:14,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:21:14,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:14,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:21:14,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:14,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:21:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:21:14,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:21:14,922 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 5 states. [2018-11-18 16:21:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:15,022 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2018-11-18 16:21:15,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:21:15,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-18 16:21:15,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:15,023 INFO L225 Difference]: With dead ends: 92 [2018-11-18 16:21:15,023 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 16:21:15,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:21:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 16:21:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-11-18 16:21:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 16:21:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-11-18 16:21:15,033 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 39 [2018-11-18 16:21:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:15,033 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-11-18 16:21:15,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:21:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-18 16:21:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 16:21:15,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:15,035 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2018-11-18 16:21:15,035 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:15,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash -495515594, now seen corresponding path program 1 times [2018-11-18 16:21:15,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:15,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 16:21:15,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:15,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:21:15,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:15,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:21:15,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:21:15,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:21:15,090 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-11-18 16:21:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:15,185 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2018-11-18 16:21:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:21:15,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-18 16:21:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:15,187 INFO L225 Difference]: With dead ends: 98 [2018-11-18 16:21:15,187 INFO L226 Difference]: Without dead ends: 97 [2018-11-18 16:21:15,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:21:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-18 16:21:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-18 16:21:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 16:21:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2018-11-18 16:21:15,196 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 42 [2018-11-18 16:21:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:15,197 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2018-11-18 16:21:15,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:21:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-11-18 16:21:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 16:21:15,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:15,198 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1] [2018-11-18 16:21:15,198 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:15,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash 465451333, now seen corresponding path program 1 times [2018-11-18 16:21:15,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:15,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:15,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 16:21:15,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:15,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:21:15,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:15,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:21:15,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:21:15,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:15,252 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand 3 states. [2018-11-18 16:21:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:15,259 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-18 16:21:15,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:21:15,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 16:21:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:15,261 INFO L225 Difference]: With dead ends: 94 [2018-11-18 16:21:15,261 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 16:21:15,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 16:21:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-18 16:21:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 16:21:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2018-11-18 16:21:15,272 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 48 [2018-11-18 16:21:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:15,272 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-11-18 16:21:15,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:21:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2018-11-18 16:21:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 16:21:15,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:15,274 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:15,274 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:15,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:15,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1523265789, now seen corresponding path program 1 times [2018-11-18 16:21:15,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:15,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:15,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:21:15,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:15,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:21:15,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:15,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:21:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:21:15,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:21:15,410 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 5 states. [2018-11-18 16:21:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:15,443 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-11-18 16:21:15,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:21:15,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 16:21:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:15,447 INFO L225 Difference]: With dead ends: 93 [2018-11-18 16:21:15,447 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 16:21:15,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:21:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 16:21:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-18 16:21:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 16:21:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-11-18 16:21:15,459 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 48 [2018-11-18 16:21:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:15,460 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-11-18 16:21:15,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:21:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-18 16:21:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 16:21:15,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:15,461 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:15,462 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:15,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1209675883, now seen corresponding path program 1 times [2018-11-18 16:21:15,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:15,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:15,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 16:21:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:21:15,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:15,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:21:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:21:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:21:15,631 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 5 states. [2018-11-18 16:21:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:15,670 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-18 16:21:15,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:21:15,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 16:21:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:15,672 INFO L225 Difference]: With dead ends: 89 [2018-11-18 16:21:15,672 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 16:21:15,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:21:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 16:21:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2018-11-18 16:21:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 16:21:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-11-18 16:21:15,677 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 53 [2018-11-18 16:21:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:15,677 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-18 16:21:15,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:21:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-11-18 16:21:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:21:15,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:15,679 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:15,679 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:15,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash 375918826, now seen corresponding path program 1 times [2018-11-18 16:21:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:15,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 16:21:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:21:15,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:21:15,782 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-11-18 16:21:15,783 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [28], [29], [31], [33], [35], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60], [61], [62], [64] [2018-11-18 16:21:15,808 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:21:15,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:21:15,915 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:21:15,916 INFO L272 AbstractInterpreter]: Visited 20 different actions 55 times. Never merged. Never widened. Performed 103 root evaluator evaluations with a maximum evaluation depth of 3. Performed 103 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-18 16:21:15,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:15,921 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:21:15,969 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 16:21:15,969 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:21:16,038 INFO L415 sIntCurrentIteration]: We unified 70 AI predicates to 70 [2018-11-18 16:21:16,038 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:21:16,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:21:16,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-18 16:21:16,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:16,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:21:16,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:21:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:21:16,040 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 7 states. [2018-11-18 16:21:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:16,210 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2018-11-18 16:21:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:21:16,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-18 16:21:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:16,211 INFO L225 Difference]: With dead ends: 150 [2018-11-18 16:21:16,212 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 16:21:16,212 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:21:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 16:21:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-11-18 16:21:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 16:21:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-11-18 16:21:16,218 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 71 [2018-11-18 16:21:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:16,218 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-11-18 16:21:16,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:21:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-18 16:21:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 16:21:16,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:21:16,222 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:16,223 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:21:16,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1826095791, now seen corresponding path program 1 times [2018-11-18 16:21:16,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:21:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:16,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:16,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:21:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-18 16:21:16,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:21:16,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:21:16,311 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-11-18 16:21:16,312 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [28], [29], [31], [33], [35], [37], [39], [41], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [64] [2018-11-18 16:21:16,313 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:21:16,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:21:16,373 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:21:16,373 INFO L272 AbstractInterpreter]: Visited 24 different actions 92 times. Merged at 7 different actions 16 times. Never widened. Performed 243 root evaluator evaluations with a maximum evaluation depth of 3. Performed 243 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-18 16:21:16,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:16,380 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:21:16,426 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 56.41% of their original sizes. [2018-11-18 16:21:16,426 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:21:16,515 INFO L415 sIntCurrentIteration]: We unified 86 AI predicates to 86 [2018-11-18 16:21:16,515 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:21:16,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:21:16,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-18 16:21:16,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:21:16,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:21:16,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:21:16,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:21:16,516 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 13 states. [2018-11-18 16:21:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:16,814 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-11-18 16:21:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 16:21:16,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2018-11-18 16:21:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:21:16,814 INFO L225 Difference]: With dead ends: 97 [2018-11-18 16:21:16,815 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:21:16,817 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-11-18 16:21:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:21:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:21:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:21:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:21:16,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-11-18 16:21:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:21:16,818 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:16,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:21:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:21:16,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:21:16,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:21:16,953 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,953 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-18 16:21:16,953 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-11-18 16:21:16,953 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,954 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j) (or (= |rec2_#t~ret3| 0) (= (+ |rec2_#t~ret3| 1) 0))) (< 2147483647 |rec2_#in~j|)) [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,955 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,956 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,956 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,956 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-18 16:21:16,956 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,956 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,956 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 16:21:16,956 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:21:16,956 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 16:21:16,956 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:21:16,956 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:21:16,956 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-18 16:21:16,956 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-18 16:21:16,957 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-18 16:21:16,957 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-18 16:21:16,957 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-18 16:21:16,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:21:16 BoogieIcfgContainer [2018-11-18 16:21:16,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:21:16,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:21:16,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:21:16,960 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:21:16,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:13" (3/4) ... [2018-11-18 16:21:16,963 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:21:16,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:21:16,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-18 16:21:16,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-18 16:21:16,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:21:16,972 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 16:21:16,972 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 16:21:16,972 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:21:17,014 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d6a57467-a2fe-4a79-b24a-8b638d1cccae/bin-2019/utaipan/witness.graphml [2018-11-18 16:21:17,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:21:17,015 INFO L168 Benchmark]: Toolchain (without parser) took 3917.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 962.3 MB in the beginning and 1.1 GB in the end (delta: -88.1 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:17,016 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:21:17,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.94 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:17,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.14 ms. Allocated memory is still 1.0 GB. Free memory is still 951.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:21:17,017 INFO L168 Benchmark]: Boogie Preprocessor took 20.74 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:17,017 INFO L168 Benchmark]: RCFGBuilder took 362.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:17,018 INFO L168 Benchmark]: TraceAbstraction took 3305.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:17,018 INFO L168 Benchmark]: Witness Printer took 55.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:17,020 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.94 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.14 ms. Allocated memory is still 1.0 GB. Free memory is still 951.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.74 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 362.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3305.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * Witness Printer took 55.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 3.2s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 657 SDtfs, 218 SDslu, 1346 SDs, 0 SdLazy, 229 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 220 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9198717948717948 AbsIntWeakeningRatio, 0.532051282051282 AbsIntAvgWeakeningVarsNumRemoved, 0.10256410256410256 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 57 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 99 PreInvPairs, 103 NumberOfFragments, 75 HoareAnnotationTreeSize, 99 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 62 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 36771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 363/412 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...