./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/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 cb528549fa76ae8087cf7043645dfa20323a0116 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:30:35,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:30:35,245 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:30:35,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:30:35,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:30:35,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:30:35,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:30:35,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:30:35,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:30:35,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:30:35,259 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:30:35,259 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:30:35,260 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:30:35,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:30:35,261 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:30:35,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:30:35,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:30:35,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:30:35,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:30:35,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:30:35,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:30:35,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:30:35,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:30:35,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:30:35,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:30:35,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:30:35,273 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:30:35,273 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:30:35,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:30:35,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:30:35,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:30:35,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:30:35,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:30:35,275 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:30:35,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:30:35,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:30:35,278 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 13:30:35,288 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:30:35,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:30:35,289 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:30:35,289 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:30:35,289 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:30:35,289 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:30:35,290 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:30:35,290 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:30:35,290 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:30:35,290 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:30:35,290 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:30:35,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:30:35,291 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:30:35,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:30:35,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:30:35,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:30:35,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:30:35,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:30:35,292 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 13:30:35,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:30:35,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:30:35,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:30:35,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:30:35,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:30:35,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:30:35,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:30:35,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:30:35,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:30:35,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:30:35,293 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:30:35,293 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:30:35,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:30:35,293 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:30:35,293 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_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2018-11-10 13:30:35,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:30:35,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:30:35,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:30:35,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:30:35,330 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:30:35,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 13:30:35,368 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/data/cb3166224/19da5666c16b42fdbfa2583ea1aaf843/FLAG48c88cb3c [2018-11-10 13:30:35,680 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:30:35,680 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 13:30:35,685 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/data/cb3166224/19da5666c16b42fdbfa2583ea1aaf843/FLAG48c88cb3c [2018-11-10 13:30:35,695 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/data/cb3166224/19da5666c16b42fdbfa2583ea1aaf843 [2018-11-10 13:30:35,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:30:35,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:30:35,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:30:35,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:30:35,702 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:30:35,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e3325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35, skipping insertion in model container [2018-11-10 13:30:35,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:30:35,724 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:30:35,834 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:30:35,837 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:30:35,849 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:30:35,861 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:30:35,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35 WrapperNode [2018-11-10 13:30:35,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:30:35,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:30:35,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:30:35,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:30:35,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:30:35,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:30:35,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:30:35,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:30:35,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... [2018-11-10 13:30:35,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:30:35,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:30:35,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:30:35,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:30:35,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/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-10 13:30:35,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:30:35,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:30:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-10 13:30:35,983 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-10 13:30:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-10 13:30:35,983 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-10 13:30:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:30:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:30:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:30:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:30:36,174 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:30:36,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:36 BoogieIcfgContainer [2018-11-10 13:30:36,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:30:36,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:30:36,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:30:36,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:30:36,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:30:35" (1/3) ... [2018-11-10 13:30:36,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dbe4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:30:36, skipping insertion in model container [2018-11-10 13:30:36,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:35" (2/3) ... [2018-11-10 13:30:36,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dbe4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:30:36, skipping insertion in model container [2018-11-10 13:30:36,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:36" (3/3) ... [2018-11-10 13:30:36,183 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 13:30:36,193 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:30:36,201 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-10 13:30:36,216 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-10 13:30:36,247 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:30:36,247 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:30:36,247 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:30:36,248 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:30:36,248 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:30:36,248 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:30:36,248 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:30:36,248 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:30:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-10 13:30:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 13:30:36,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:36,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:36,273 INFO L424 AbstractCegarLoop]: === Iteration 1 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:36,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-10 13:30:36,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:36,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:36,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:36,413 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-10 13:30:36,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:36,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:36,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:36,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:30:36,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:30:36,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:36,433 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-10 13:30:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:36,518 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-10 13:30:36,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:30:36,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 13:30:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:36,527 INFO L225 Difference]: With dead ends: 67 [2018-11-10 13:30:36,527 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 13:30:36,530 INFO L605 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-10 13:30:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 13:30:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-11-10 13:30:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 13:30:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-10 13:30:36,568 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-11-10 13:30:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:36,568 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-10 13:30:36,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:30:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-10 13:30:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 13:30:36,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:36,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:36,569 INFO L424 AbstractCegarLoop]: === Iteration 2 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:36,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-10 13:30:36,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:36,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:36,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,571 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:36,605 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-10 13:30:36,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:36,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:30:36,606 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:36,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:36,608 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-11-10 13:30:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:36,620 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-10 13:30:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:36,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 13:30:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:36,621 INFO L225 Difference]: With dead ends: 56 [2018-11-10 13:30:36,622 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 13:30:36,622 INFO L605 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-10 13:30:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 13:30:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-10 13:30:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 13:30:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-10 13:30:36,630 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 10 [2018-11-10 13:30:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:36,631 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-10 13:30:36,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-10 13:30:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 13:30:36,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:36,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:36,632 INFO L424 AbstractCegarLoop]: === Iteration 3 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:36,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:36,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2126464488, now seen corresponding path program 1 times [2018-11-10 13:30:36,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:36,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:36,677 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-10 13:30:36,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:36,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:36,678 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:36,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:30:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:30:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:36,679 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-11-10 13:30:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:36,771 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-10 13:30:36,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:30:36,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 13:30:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:36,773 INFO L225 Difference]: With dead ends: 77 [2018-11-10 13:30:36,773 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 13:30:36,773 INFO L605 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-10 13:30:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 13:30:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-11-10 13:30:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 13:30:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-11-10 13:30:36,781 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 14 [2018-11-10 13:30:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:36,781 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-10 13:30:36,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:30:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-10 13:30:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 13:30:36,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:36,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:36,782 INFO L424 AbstractCegarLoop]: === Iteration 4 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:36,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1495889727, now seen corresponding path program 1 times [2018-11-10 13:30:36,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:36,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:36,809 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-10 13:30:36,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:36,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:30:36,809 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:36,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:36,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:36,810 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2018-11-10 13:30:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:36,824 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2018-11-10 13:30:36,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:36,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 13:30:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:36,825 INFO L225 Difference]: With dead ends: 73 [2018-11-10 13:30:36,826 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 13:30:36,826 INFO L605 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-10 13:30:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 13:30:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-10 13:30:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 13:30:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-11-10 13:30:36,835 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 15 [2018-11-10 13:30:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:36,835 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-10 13:30:36,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-10 13:30:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 13:30:36,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:36,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:36,837 INFO L424 AbstractCegarLoop]: === Iteration 5 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:36,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash -440899931, now seen corresponding path program 1 times [2018-11-10 13:30:36,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:36,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:36,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:36,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:36,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:30:36,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:30:36,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:36,874 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 5 states. [2018-11-10 13:30:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:36,943 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-10 13:30:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:30:36,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 13:30:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:36,944 INFO L225 Difference]: With dead ends: 70 [2018-11-10 13:30:36,944 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 13:30:36,944 INFO L605 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-10 13:30:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 13:30:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-10 13:30:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 13:30:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-10 13:30:36,951 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2018-11-10 13:30:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:36,951 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-10 13:30:36,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:30:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-10 13:30:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 13:30:36,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:36,952 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, 1] [2018-11-10 13:30:36,953 INFO L424 AbstractCegarLoop]: === Iteration 6 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:36,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:36,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1311878191, now seen corresponding path program 1 times [2018-11-10 13:30:36,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:36,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:36,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:36,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:36,972 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-10 13:30:36,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:36,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:30:36,973 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:36,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:36,974 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 3 states. [2018-11-10 13:30:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:36,993 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-10 13:30:36,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:36,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 13:30:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:36,995 INFO L225 Difference]: With dead ends: 67 [2018-11-10 13:30:36,995 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 13:30:36,995 INFO L605 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-10 13:30:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 13:30:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-10 13:30:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 13:30:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-11-10 13:30:37,002 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2018-11-10 13:30:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:37,003 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-11-10 13:30:37,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-10 13:30:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 13:30:37,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:37,004 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, 1, 1] [2018-11-10 13:30:37,005 INFO L424 AbstractCegarLoop]: === Iteration 7 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:37,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash -840361398, now seen corresponding path program 1 times [2018-11-10 13:30:37,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:37,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:37,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:37,033 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-10 13:30:37,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:37,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:30:37,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:37,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:37,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:37,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:37,035 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 3 states. [2018-11-10 13:30:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:37,042 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-10 13:30:37,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:37,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 13:30:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:37,043 INFO L225 Difference]: With dead ends: 66 [2018-11-10 13:30:37,043 INFO L226 Difference]: Without dead ends: 65 [2018-11-10 13:30:37,043 INFO L605 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-10 13:30:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-10 13:30:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-10 13:30:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 13:30:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-10 13:30:37,048 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 23 [2018-11-10 13:30:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:37,049 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-10 13:30:37,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-10 13:30:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 13:30:37,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:37,050 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, 1, 1] [2018-11-10 13:30:37,050 INFO L424 AbstractCegarLoop]: === Iteration 8 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:37,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2013518212, now seen corresponding path program 1 times [2018-11-10 13:30:37,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:37,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:37,067 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-10 13:30:37,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:37,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:30:37,068 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:37,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:37,069 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2018-11-10 13:30:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:37,089 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-10 13:30:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:37,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 13:30:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:37,091 INFO L225 Difference]: With dead ends: 90 [2018-11-10 13:30:37,091 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 13:30:37,091 INFO L605 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-10 13:30:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 13:30:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-11-10 13:30:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 13:30:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2018-11-10 13:30:37,101 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 23 [2018-11-10 13:30:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:37,101 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-11-10 13:30:37,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2018-11-10 13:30:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 13:30:37,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:37,102 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, 1, 1, 1] [2018-11-10 13:30:37,102 INFO L424 AbstractCegarLoop]: === Iteration 9 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:37,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash -281399491, now seen corresponding path program 1 times [2018-11-10 13:30:37,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:37,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,104 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:37,117 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-10 13:30:37,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:37,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:30:37,117 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:37,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:37,117 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 4 states. [2018-11-10 13:30:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:37,128 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-11-10 13:30:37,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:37,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-10 13:30:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:37,129 INFO L225 Difference]: With dead ends: 84 [2018-11-10 13:30:37,129 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 13:30:37,130 INFO L605 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-10 13:30:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 13:30:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-10 13:30:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 13:30:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-11-10 13:30:37,137 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 24 [2018-11-10 13:30:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:37,138 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-11-10 13:30:37,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-11-10 13:30:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 13:30:37,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:37,139 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:37,139 INFO L424 AbstractCegarLoop]: === Iteration 10 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:37,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1215449003, now seen corresponding path program 1 times [2018-11-10 13:30:37,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:37,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:37,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,142 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:30:37,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:37,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:37,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:37,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:30:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:30:37,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:37,169 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 5 states. [2018-11-10 13:30:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:37,233 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-10 13:30:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:30:37,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-10 13:30:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:37,234 INFO L225 Difference]: With dead ends: 105 [2018-11-10 13:30:37,234 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 13:30:37,235 INFO L605 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-10 13:30:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 13:30:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-10 13:30:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 13:30:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-10 13:30:37,245 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 27 [2018-11-10 13:30:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:37,245 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-10 13:30:37,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:30:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-10 13:30:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 13:30:37,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:37,247 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-11-10 13:30:37,247 INFO L424 AbstractCegarLoop]: === Iteration 11 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:37,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash 505515198, now seen corresponding path program 1 times [2018-11-10 13:30:37,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:37,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:30:37,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:37,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:37,289 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:37,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:30:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:30:37,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:37,290 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 5 states. [2018-11-10 13:30:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:37,340 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-11-10 13:30:37,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:30:37,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 13:30:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:37,342 INFO L225 Difference]: With dead ends: 104 [2018-11-10 13:30:37,342 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 13:30:37,343 INFO L605 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-10 13:30:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 13:30:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-11-10 13:30:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 13:30:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2018-11-10 13:30:37,353 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 38 [2018-11-10 13:30:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:37,353 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2018-11-10 13:30:37,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:30:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2018-11-10 13:30:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 13:30:37,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:37,356 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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-10 13:30:37,357 INFO L424 AbstractCegarLoop]: === Iteration 12 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:37,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash -30814145, now seen corresponding path program 1 times [2018-11-10 13:30:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:30:37,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:37,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:30:37,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:37,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:37,394 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand 4 states. [2018-11-10 13:30:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:37,444 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-10 13:30:37,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:37,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-10 13:30:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:37,446 INFO L225 Difference]: With dead ends: 110 [2018-11-10 13:30:37,446 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 13:30:37,447 INFO L605 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-10 13:30:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 13:30:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-10 13:30:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 13:30:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-11-10 13:30:37,456 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 36 [2018-11-10 13:30:37,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:37,456 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-11-10 13:30:37,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-11-10 13:30:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 13:30:37,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:37,457 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 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] [2018-11-10 13:30:37,458 INFO L424 AbstractCegarLoop]: === Iteration 13 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:37,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash -464316786, now seen corresponding path program 1 times [2018-11-10 13:30:37,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:37,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:37,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 13:30:37,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:37,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:30:37,481 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:37,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:37,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:37,482 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 3 states. [2018-11-10 13:30:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:37,495 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-11-10 13:30:37,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:37,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 13:30:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:37,497 INFO L225 Difference]: With dead ends: 106 [2018-11-10 13:30:37,497 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 13:30:37,497 INFO L605 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-10 13:30:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 13:30:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-10 13:30:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 13:30:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2018-11-10 13:30:37,503 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 42 [2018-11-10 13:30:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:37,504 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2018-11-10 13:30:37,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2018-11-10 13:30:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 13:30:37,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:37,505 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:37,505 INFO L424 AbstractCegarLoop]: === Iteration 14 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:37,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1915961670, now seen corresponding path program 1 times [2018-11-10 13:30:37,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:37,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:30:37,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:30:37,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:30:37,556 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-10 13:30:37,557 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [24], [25], [28], [29], [31], [33], [35], [37], [39], [40], [41], [42], [46], [56], [57], [58], [59], [60], [61], [62], [64] [2018-11-10 13:30:37,594 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:30:37,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:30:37,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:30:37,701 INFO L272 AbstractInterpreter]: Visited 24 different actions 29 times. Merged at 2 different actions 2 times. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 13:30:37,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:37,706 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:30:37,766 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.67% of their original sizes. [2018-11-10 13:30:37,767 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:30:37,869 INFO L415 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2018-11-10 13:30:37,870 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:30:37,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:30:37,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-10 13:30:37,871 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:37,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 13:30:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 13:30:37,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:30:37,872 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 14 states. [2018-11-10 13:30:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:38,568 INFO L93 Difference]: Finished difference Result 234 states and 290 transitions. [2018-11-10 13:30:38,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 13:30:38,568 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-10 13:30:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:38,569 INFO L225 Difference]: With dead ends: 234 [2018-11-10 13:30:38,569 INFO L226 Difference]: Without dead ends: 138 [2018-11-10 13:30:38,571 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:30:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-10 13:30:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2018-11-10 13:30:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 13:30:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2018-11-10 13:30:38,583 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 40 [2018-11-10 13:30:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:38,584 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2018-11-10 13:30:38,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 13:30:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2018-11-10 13:30:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 13:30:38,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:38,586 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 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] [2018-11-10 13:30:38,586 INFO L424 AbstractCegarLoop]: === Iteration 15 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:38,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1469659330, now seen corresponding path program 1 times [2018-11-10 13:30:38,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:38,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:38,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:38,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 13:30:38,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:38,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:38,631 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:38,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:30:38,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:30:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:38,632 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 5 states. [2018-11-10 13:30:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:38,661 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2018-11-10 13:30:38,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:30:38,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-10 13:30:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:38,663 INFO L225 Difference]: With dead ends: 132 [2018-11-10 13:30:38,663 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 13:30:38,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10 13:30:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 13:30:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2018-11-10 13:30:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-10 13:30:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2018-11-10 13:30:38,675 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 47 [2018-11-10 13:30:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:38,675 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2018-11-10 13:30:38,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:30:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2018-11-10 13:30:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 13:30:38,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:38,678 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:38,678 INFO L424 AbstractCegarLoop]: === Iteration 16 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:38,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:38,679 INFO L82 PathProgramCache]: Analyzing trace with hash 814042608, now seen corresponding path program 1 times [2018-11-10 13:30:38,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:38,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:38,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:38,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 58 proven. 13 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 13:30:38,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:30:38,758 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:30:38,758 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2018-11-10 13:30:38,758 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [29], [31], [33], [35], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60], [61], [62], [64] [2018-11-10 13:30:38,760 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:30:38,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:30:38,833 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:30:38,833 INFO L272 AbstractInterpreter]: Visited 34 different actions 169 times. Merged at 13 different actions 26 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-10 13:30:38,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:38,837 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:30:38,892 INFO L227 lantSequenceWeakener]: Weakened 35 states. On average, predicates are now at 60.67% of their original sizes. [2018-11-10 13:30:38,892 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:30:39,113 INFO L415 sIntCurrentIteration]: We unified 94 AI predicates to 94 [2018-11-10 13:30:39,113 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:30:39,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:30:39,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [6] total 28 [2018-11-10 13:30:39,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:39,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 13:30:39,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 13:30:39,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-11-10 13:30:39,115 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand 24 states. [2018-11-10 13:30:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:40,763 INFO L93 Difference]: Finished difference Result 182 states and 219 transitions. [2018-11-10 13:30:40,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 13:30:40,763 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-10 13:30:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:40,764 INFO L225 Difference]: With dead ends: 182 [2018-11-10 13:30:40,764 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 13:30:40,767 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 117 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1893, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 13:30:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 13:30:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-10 13:30:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 13:30:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-10 13:30:40,775 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 95 [2018-11-10 13:30:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:40,775 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-10 13:30:40,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 13:30:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-10 13:30:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 13:30:40,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:40,776 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:40,777 INFO L424 AbstractCegarLoop]: === Iteration 17 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:30:40,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash 77369472, now seen corresponding path program 1 times [2018-11-10 13:30:40,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:40,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:40,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 13:30:40,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:30:40,813 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:30:40,813 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-11-10 13:30:40,813 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [21], [23], [24], [25], [28], [29], [31], [33], [35], [37], [39], [40], [41], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [64] [2018-11-10 13:30:40,815 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:30:40,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:30:40,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:30:40,864 INFO L272 AbstractInterpreter]: Visited 40 different actions 191 times. Merged at 18 different actions 35 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 6 variables. [2018-11-10 13:30:40,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:40,866 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:30:40,912 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 63.13% of their original sizes. [2018-11-10 13:30:40,913 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:30:41,213 INFO L415 sIntCurrentIteration]: We unified 63 AI predicates to 63 [2018-11-10 13:30:41,213 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:30:41,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:30:41,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [5] total 34 [2018-11-10 13:30:41,214 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:41,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 13:30:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 13:30:41,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2018-11-10 13:30:41,214 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 31 states. [2018-11-10 13:30:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:43,301 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-10 13:30:43,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 13:30:43,301 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-11-10 13:30:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:43,302 INFO L225 Difference]: With dead ends: 79 [2018-11-10 13:30:43,302 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:30:43,305 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=356, Invalid=3066, Unknown=0, NotChecked=0, Total=3422 [2018-11-10 13:30:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:30:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:30:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:30:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:30:43,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-11-10 13:30:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:43,306 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:30:43,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 13:30:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:30:43,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:30:43,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:30:43,546 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2018-11-10 13:30:43,817 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-10 13:30:43,818 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse1 (* 2 |rec1_#in~i|))) (let ((.cse2 (+ .cse1 2))) (let ((.cse3 (< .cse2 0)) (.cse0 (* 2 rec1_~i))) (and (or (and (<= 1 rec1_~i) (<= .cse0 4294967292)) (< .cse1 0) (< 4294967292 .cse1)) (or (< 0 .cse2) .cse3) (not (= |rec1_#in~i| 0)) (or .cse3 (< 4294967288 .cse1) (<= .cse0 4294967288)))))) [2018-11-10 13:30:43,818 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse2 (* 2 |rec1_#in~i|))) (let ((.cse0 (+ .cse2 2))) (let ((.cse1 (< .cse0 0)) (.cse3 (* 2 rec1_~i))) (and (or (< 0 .cse0) .cse1) (or (< .cse2 0) (< 4294967292 .cse2) (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (<= 1 rec1_~i) (<= .cse3 4294967292))) (not (= |rec1_#in~i| 0)) (or .cse1 (< 4294967288 .cse2) (<= .cse3 4294967288)))))) [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse4 (* 2 |rec1_#in~i|))) (let ((.cse0 (+ .cse4 2))) (let ((.cse1 (< .cse0 0)) (.cse3 (* 2 rec1_~i))) (and (or (< 0 .cse0) .cse1) (not (= |rec1_#in~i| 0)) (or (let ((.cse2 (* 2 |rec1_#t~ret1|))) (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (<= 1 rec1_~i) (<= 0 .cse2) (<= .cse2 0) (<= .cse3 4294967292))) (< .cse4 0) (< 4294967292 .cse4)) (or .cse1 (<= .cse3 4294967288) (< 4294967288 .cse4)))))) [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,819 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (not (= |rec2_#in~j| 1)) (= rec2_~j 1)) (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< (+ (* 2 |rec2_#in~j|) 4294967296) 0) (< 2147483647 |rec2_#in~j|)) (not (= |rec2_#in~j| 0))) [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (not (= |rec2_#in~j| 1)) (and (= rec2_~j 1) (<= (* 2 |rec2_#t~ret3|) 0))) (let ((.cse2 (* 2 rec2_~j))) (let ((.cse0 (<= .cse2 4294967294)) (.cse1 (<= 2 .cse2))) (or (< (+ (* 2 |rec2_#in~j|) 4294967296) 0) (and (= |rec2_#t~ret3| 0) .cse0 .cse1) (and .cse0 (= |rec2_#t~ret3| 1) .cse1) (< 2147483647 |rec2_#in~j|)))) (not (= |rec2_#in~j| 0))) [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 13:30:43,820 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-10 13:30:43,820 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:30:43,821 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:30:43,821 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:30:43,821 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:30:43,821 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-10 13:30:43,821 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-10 13:30:43,821 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (* 2 main_~x~0))) (and (<= 0 (+ .cse0 4294967296)) (<= .cse0 4294967294))) [2018-11-10 13:30:43,821 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-10 13:30:43,821 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-10 13:30:43,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:30:43 BoogieIcfgContainer [2018-11-10 13:30:43,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:30:43,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:30:43,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:30:43,824 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:30:43,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:36" (3/4) ... [2018-11-10 13:30:43,827 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:30:43,833 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:30:43,834 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-10 13:30:43,834 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-10 13:30:43,834 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:30:43,838 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 13:30:43,839 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 13:30:43,839 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 13:30:43,877 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b9e419c3-e1cc-43e1-8fe4-03f1544ee6e7/bin-2019/utaipan/witness.graphml [2018-11-10 13:30:43,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:30:43,878 INFO L168 Benchmark]: Toolchain (without parser) took 8180.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 958.1 MB in the beginning and 856.1 MB in the end (delta: 102.0 MB). Peak memory consumption was 437.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:43,879 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:30:43,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.14 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:43,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.77 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:30:43,880 INFO L168 Benchmark]: Boogie Preprocessor took 14.30 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:43,880 INFO L168 Benchmark]: RCFGBuilder took 282.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:43,881 INFO L168 Benchmark]: TraceAbstraction took 7648.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 856.1 MB in the end (delta: 288.6 MB). Peak memory consumption was 464.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:43,881 INFO L168 Benchmark]: Witness Printer took 53.91 ms. Allocated memory is still 1.4 GB. Free memory is still 856.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:30:43,884 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.14 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 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 14.77 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.30 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7648.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 856.1 MB in the end (delta: 288.6 MB). Peak memory consumption was 464.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.91 ms. Allocated memory is still 1.4 GB. Free memory is still 856.1 MB. There was no memory consumed. 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, 7.5s OverallTime, 17 OverallIterations, 11 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 711 SDtfs, 528 SDslu, 1936 SDs, 0 SdLazy, 468 SolverSat, 212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 311 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9290816326530623 AbsIntWeakeningRatio, 0.5357142857142857 AbsIntAvgWeakeningVarsNumRemoved, 3.423469387755102 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 65 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 149 PreInvPairs, 158 NumberOfFragments, 331 HoareAnnotationTreeSize, 149 FomulaSimplifications, 193 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 1065 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 532 ConstructedInterpolants, 0 QuantifiedInterpolants, 34312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 422/445 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...